import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())


def phi(n):
    ans = n
    for i in range(2,int(n**.5)+1):
        if n % i == 0:
            ans = (ans*(i-1))//i
            while n % i == 0:
                n //= i
            if n == 1:  # 時間短縮
                break
    if n != 1:
        ans = (ans*(n-1))//n
    return ans


def divisor(n):  # nの約数全列挙
    res = []
    for i in range(1,int(n**.5)+1):
        if n % i == 0:
            res.append(i)
            if i != n//i:
                res.append(n//i)
    return res


T = I()
for _ in range(T):
    N = I()
    while N % 2 == 0:
        N //= 2
    while N % 5 == 0:
        N //= 5

    if N == 1:
        print(1)
        continue

    r = phi(N)
    div = divisor(r)
    div.sort()

    for d in div:
        if pow(10,d,N) == 1:
            print(d)
            break