#!/bin/python import sys def isprime(x): i=2 while i*i<=x: if x%i==0: return False i+=1 return True def getprimes(n): ans=[] for i in range(2,n+1): if isprime(i): ans.append(i) return ans g = int(raw_input().strip()) inputs=[] for a0 in xrange(g): inputs.append(int(raw_input().strip())) n=max(inputs) arr=getprimes(n) for i in inputs: counts=0 j=0 while j