from collections import defaultdict
def prime_factorize(n):
    a=defaultdict(int)
    while n%2==0:n//=2;a[2]+=1
    f=3
    while f*f<=n:
        if n%f==0:n//=f;a[f]+=1
        else:f+=2
    if n!=1:a[n]+=1
    return a

Q=int(input())
for _ in range(Q):
    N=int(input())
    pf=prime_factorize(N)
    orders=set(pf.values())
    if len(orders)==1:
        print(orders.pop())
    else:print(1)