def sqrt(n, k = 2):
    if n == 0: return 0
    l = k - 1
    if not n: return 0
    y = 1 << (n.bit_length() + l) // k
    x = y + 1
    while y < x:
        x = y
        y = (l * x + n // (x ** l)) // k
    return x
def cnt(n):
    s = 1
    for b, w in WW:
        s += w * (sqrt(n, b) - 1)
    return s
    
WW = [(2, 1), (3, 1), (5, 1), (6, -1), (7, 1), (10, -1), (11, 1), (13, 1), (14, -1), (15, -1), (17, 1), (19, 1), (21, -1), (22, -1), (23, 1), (26, -1), (29, 1), (30, 1), (31, 1), (33, -1), (34, -1), (35, -1), (37, 1), (38, -1), (39, -1), (41, 1), (42, 1), (43, 1), (46, -1), (47, 1), (51, -1), (53, 1), (55, -1), (57, -1), (58, -1), (59, 1)]
T = int(input())
for _ in range(T):
    K = int(input())
    l, r = 0, 10 ** 18
    while r - l > 1:
        m = l + r >> 1
        if cnt(m) < K:
            l = m
        else:
            r = m
    print(r)