t = int(input())
cs = [int(input()) for i in range(t)]

def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    #divisors.sort()
    return len(divisors)


for i in range(t):
    k = cs[i]

    wa = 0#敢えて-1している（ダメな方）
    ac = 10**18#OKな方
    
    while wa+1 < ac:
        tmp = 0
        mid = (wa + ac) //2
        
        #判定書く
        for j in range(2,61):
            kb = make_divisors(j)
            kb = kb % 2 + 2*((kb-2)//2)
            val = int(mid**(1/j))
            plus = (val+1)**j
            if plus <= mid:
                tmp += val
                tmp -= (val)*kb
            else:
                tmp += val-1
                tmp -= (val-1)*kb
            #print(val,tmp,j,kb)
        #print(tmp)
        #exit()
        if tmp >= k-1:
            ac = mid
        else:
            wa = mid
        #print(mid,tmp)
            
    print(ac)