For this Question: Find the number of prime numbers before N (Including that number too).The first line of the input contains the number of test cases T.
Next T lines contain the value N.

<b>Constraints</b>
1 <= T <= 1e5
1 <= N <= 1e5Print the number of primes number before that number.Sample Input 1:
2
3
11

Sample Output 1:
2
5, I have written this Solution Code: m=100001
prime=[True for i in range(m)]
p=2
while(p*p<=m):
    if prime[p]:
        for i in range(p*p,m,p):
            prime[i]=False
    p+=1

c=[0 for i in range(m)]
c[2]=1
for i in range(3,m):
    if prime[i]:
        c[i]=c[i-1]+1
    else:
        c[i]=c[i-1]
t=int(input())
while t>0:
    n=int(input())
    print(c[n])
    t-=1, In this Programming Language: Python, Now tell me if this Code is compilable or not?