import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
inf = 10**19
# md = 998244353
md = 10**9 + 7

def EulerPhi(n):
    res = n
    for i in range(2, n + 1):
        if i**2 >= n: break
        if n % i == 0:
            res -= res // i
            while n % i == 0: n //= i
    if n > 1: res -= res // n
    return res

def factors(a):
    if a<=0:return [0]
    dd0=[]
    dd1=[]
    for d in range(1,a+1):
        if d*d>a:break
        if a%d:continue
        dd0.append(d)
        dd1.append(a//d)
    if dd0[-1]==dd1[-1]:dd1.pop()
    return dd0+dd1[::-1]

for _ in range(II()):
    n = II()
    while n & 1 == 0: n >>= 1
    while n % 5 == 0: n //= 5
    if n==1:
        print(1)
        continue
    p=EulerPhi(n)
    ff=factors(p)
    ans=inf
    for f in ff:
        if pow(10,f,n)==1:ans=min(ans,f)

    print(ans)