#include <bits/stdc++.h> 

using namespace std;

map <long long int, long long int> phi;
vector <long long int> prime;

long long int mypow(long long int x, long long int n)
{
    long long int res = 1;
    while (n > 0)
    {
        if (n % 2 == 1)
        {
            res = ((res) * (x));
        }
        x = (x * x);
        n /= 2;
    }
    return res;
}

void eratos(void)
{
    bool isprime[32001];
    memset(isprime, true, sizeof(isprime));
    for (int i = 2; i <= 32000; i++)
    {
        if (isprime[i])
        {
            prime.push_back(i);
            for (int j = 2 * i; j <= 32000; j += i)
            {
                isprime[j] = false;
            }
        }
    }
}

long long int mypow(long long int x, long long int n, long long int m)
{
    long long int res = 1;
    while (n > 0)
    {
        if (n % 2 == 1)
        {
            res = ((res % m) * (x % m) % m);
            res %= m;
        }
        x = ((x % m) * (x % m) % m);
        x %= m;
        n /= 2;
    }
    return res;
}

int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int N, t;
    vector <int> v;

    cin >> N;

    for (int i = 0; i < N; i++)
    {
        cin >> t;
        while (t % 2 == 0)
        {
            t /= 2;
        }
        while (t % 5 == 0)
        {
            t /= 5;
        }
        v.push_back(t);
    }

    eratos();

    for(int i=0;i<N;i++)
    {
        map <int, int> m;
        int n;
        long long int res = 1;
        n = v[i];
        while (1)
        {
            bool ok = false;
            for (int i = 2; i <= sqrt(n); i++)
            {
                if (n % i == 0)
                {
                    ok = true;
                    m[i]++;
                    n /= i;
                    break;
                }
            }
            if (ok == false)
            {
                m[n]++;
                break;
            }
        }
        for (auto x : m)
        {
            res *= (pow(x.first, x.second) - pow(x.first, x.second - 1));
        }

        phi[v[i]] = res;
    }

    for (int i = 0; i < N; i++)
    {
        if (v[i] == 1)
        {
            cout << 1 << '\n';
            continue;
        }
        int temp = phi[v[i]];
        int res = 1e9;
        for (int j = 1; j <= sqrt(temp); j++)
        {
            if (temp % j == 0)
            {
                if (mypow(10, j, v[i]) == 1)
                {
                    res = min(res, j);
                }
                if (mypow(10, temp / j, v[i]) == 1)
                {
                    res = min(res, temp / j);
                }
            }
        }
        cout << res << '\n';
    }
    return 0;
}