import sys
input = sys.stdin.readline

def div(n):
    i = 1
    SS = set()
    while i * i <= n:
        if n % i == 0:
            SS.add(i)
            SS.add(n//i)
        i += 1
    return SS

def euler_phi(n):
    temp = n
    val = n
    for i in range(2, int(-(-n**0.5 // 1)) + 1):
        if temp % i == 0:
            val *= (i - 1)
            val //= i
            while temp % i == 0:
                temp //= i
 
    if temp != 1:
        val *= (temp - 1)
        val //= temp

    return val


T = int(input())
for _ in range(T):
    N = int(input())
    while N % 2 == 0:
        N //= 2
    while N % 5 == 0:
        N //= 5
    inf = 10 ** 18
    ans = inf
    for t in div(euler_phi(N)):
        if pow(10, t, N) == 1:
            ans = min(ans, t)

    print(ans) if ans != inf else print(1)