def is_prime(num): arr = [] sieve = [True] * (num+1) tmp = (2*num)**0.5+1 for i in range(2, tmp): if sieve[i]: for j in range(i*2, num, i): if i % j == 0: n = int(input()) for i in range(n): res = is_prime(n) print(res)