from sys import stdin,setrecursionlimit#,set_int_max_str_digits
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
# setrecursionlimit(2000000) # これこどふぉだと無理
# set_int_max_str_digits(200010)
mod = 998244353 
ii = lambda :int(stdin.readline())
mi = lambda :map(int,stdin.readline().split())
li = lambda :list(mi())
gmi = lambda :map(lambda x: int(x) - 1, stdin.readline().split())
gi = lambda :list(map(lambda x: 0 if x == "." else 1,input())) # グリッド入力受け取り
py = lambda :print("Yes")
pn = lambda :print("No")
pf = lambda :print("First") 
ps = lambda :print("Second")
pyn = lambda x: print("Yes") if x else print("No")
vec = [(1,0),(-1,0),(0,-1),(0,1)]
vec1 = [(1,0),(1,1),(0,1),(-1,1),(-1,0),(-1,-1),(0,-1),(1,-1)] #8方向
vec2 = [(1,1),(1,0),(0,-1),(-1,-1),(-1,0),(0,1)] # 六角形グリッド
inf = 10**18
from collections import defaultdict,deque
from heapq import heappop,heappush
#from random import randint

q = ii() 


def nth_root(x,n):
    y = 1
    while True:
        # ニュートン法: y_k+1 = (1/n) * [ (n-1)*y_k + x / (y_k^(n-1)) ]
        ny = ((n-1) * y + x //pow(y,n-1))//n
        if y == ny:
            return y
        y = ny


for _ in range(q):
    n = ii() 
    k = n.bit_length()
    ans = 1
    for i in range(2,k):
        ok = nth_root(n,i)
        if pow(ok,i) == n:
            ans = i
    print(ans)