import sys

def main():
    max_n = 10**5
    sieve = [True] * (max_n + 1)
    sieve[0] = sieve[1] = False
    for i in range(2, int(max_n**0.5) + 1):
        if sieve[i]:
            sieve[i*i::i] = [False] * len(sieve[i*i::i])
    
    primes_count = [0] * (max_n + 1)
    cnt = 0
    for i in range(max_n + 1):
        if sieve[i]:
            cnt += 1
        primes_count[i] = cnt
    
    input = sys.stdin.read().split()
    T = int(input[0])
    for i in range(1, T+1):
        N = int(input[i])
        res = (N - 1) - primes_count[N]
        print(res if res >= 0 else 0)
        
if __name__ == "__main__":
    main()