def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]

def f(x):
    while x>=3:
        x=x-len(make_divisors(x))
    return x
n=int(input())
l=[]
for i in range(n):
    m=int(input())
    l.append(f(m))

for x in l:
    print(x)