#yuki-1339
T = int(input())

candidates = [2*i+1 for i in range(1, 10811)]
primelist = [2]
p = 3
while p**2 <= 20011:
    primelist.append(p)
    candidates = [c for c in candidates if c%p]
    p = candidates[0]
primelist += candidates

def euler(n):
    i = 1
    ans = n
    while primelist[i]**2 <= n:
        p = primelist[i]
        if not n%p:
            ans -= ans//p
            while not n%p:
                n //= p
            i += 1
        if n > 1:
            ans -= ans//n
    return ans

#def divlist(n):
    

for _ in range(T):
    N = int(input())  #10**9以下
    while not N%2:
        N //= 2
    while not N%5:
        N //= 5
    ans = euler(N)
    if ans < 2:
        print(1)
    else:
        fw, bw = [], []
        j = 1
        while j**2 <= ans:
            if not ans%j:
                fw.append(j)
                bw.append(ans//j)
            j += 1
        d = fw+bw[::-1]
        flag = 0
        i = 0
        while not flag:
            if pow(10, d[i], N) == 1:
                print(d[i])
                flag = 1
            i += 1