#pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <limits>
#include <iomanip>
#include <functional>
#include <cassert>
// #include <atcoder/all>
using namespace std;

using ll=long long;
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vii = V<int>;
using vvll = V<vll>;
using vvii = V< V<int> >;
using PII = P<int, int>;
using PLL = P<ll, ll>;
#define RevREP(i,n,a) for(ll i=n;i>a;i--)  // (a,n]
#define REP(i,a,n) for(ll i=a;i<n;i++)  // [a,n)
#define rep(i, n) REP(i,0,n)
#define ALL(v) v.begin(),v.end()
#define eb emplace_back
#define pb push_back
#define sz(v) int(v.size())

template < class T > inline bool chmax(T& a, T b) {if (a < b) { a=b; return true; } return false; }
template < class T > inline bool chmin(T& a, T b) {if (a > b) { a=b; return true; } return false; }
template< class A, class B > ostream& operator <<(ostream& out, const P<A, B> &p) {
    return out << '(' << p.first << ", " << p.second << ')';
}
template< class A > ostream& operator <<(ostream& out, const V<A> &v) {
    out << '[';
    for (int i=0;i<int(v.size());i++) {
        if (i) out << ", ";
        out << v[i];
    }
    return out << ']';
}

const long long MOD = 1000000007;
const long long HIGHINF = (long long)1e18;
const int INF = (int)1e9;

ll powmod(ll a, ll p, ll m) {
    if (p == 0) return 1;
    ll tmp = powmod(a, p >> 1, m);
    if (p & 1) return (tmp * tmp % m) * a % m;
    else return tmp * tmp % m;
}

void solve() {
    ll n; cin >> n;
    while (n % 2 == 0) n /= 2;
    while (n % 5 == 0) n /= 5;
    if (n == 1) {
        cout << 1 << '\n';
        return;
    }
    
    ll phi = n, orign = n;
    {
        vii div;
        for (ll i = 2; i * i <= n; i++) {
            if (n % i == 0) div.eb(i);
            while (n % i == 0) n /= i;
        }
        if (n > 1) div.eb(n);

        for (int bit = 1; bit < (1 << sz(div)); bit++) {
            ll mul = 1;
            for (int i = 0; i < sz(div); i++) if (bit >> i & 1) mul *= div[i];
            phi += (__builtin_popcount(bit) & 1 ? -1 : 1) * orign / mul;
        }
    }
    n = orign;

    int ans = INF;
    for (ll i = 1; i * i <= phi; i++) {
        if (phi % i == 0) {
            if (powmod(10, i, n) == 1) chmin(ans, int(i));
            if (powmod(10, phi / i, n) == 1) chmin(ans, int(phi / i));
        }
    }
    cout << ans << '\n';
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t; cin >> t;
    while (t-->0) {
        solve();
    }
    return 0;
}