def make_divisors(n):
    if n == 1:
        return [1]
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]

def f(x):
    p = n = x
    d = 2
    while d * d <= n:
        if n % d == 0:
            p = p * (d - 1) // d
            while n % d == 0:
                n //= d
        d += 1
    return [p, p * (n - 1) // n][n > 1]

for _ in range(int(input())):
    n = int(input())
    while n % 2 == 0:
        n //= 2
    while n % 5 == 0:
        n //= 5
    if n == 1:
        print(1)
        continue
    euler = f(n)
    divs = make_divisors(euler)
    for i in divs:
        if pow(10, i, n) == 1:
            print(i)
            break