#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define chmin(x,y) x = min((x),(y));
#define chmax(x,y) x = max((x),(y));
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
const int INF = 1e9;
const long long LINF = 1e17;
const int MOD = 1000000007;
//const int MOD = 998244353;
const double PI = 3.14159265358979323846;

long long phi(long long n){
    long long res = n;
    for(long long i=2;i*i<=n;i++){
        if(n%i==0){
            res /= i;
            res *= i-1;
            while(n%i==0) n/=i;
        }
    }
    if(n > 1){
        res /= n;
        res *= n-1;
    }
    return res;
}

long long modpow(long long x, long long n,ll m) {
    long long ret = 1;
    while (n > 0) {
        if (n & 1) ret = (ret * x) % m;  
        x = (x * x) % m;
        n >>= 1;  
    }
    return ret;
}

void solve(){
    ll n;
    cin >> n;
    while(n%2==0) n /= 2;
    while(n%5==0) n /= 5;
    ll p = phi(n);
    ll ans = p;
    for(ll i=1;i*i<=p;i++){
        if(p%i==0){
            if(modpow(10,i,n) == 1) chmin(ans,i);
            if(modpow(10,p/i,n) == 1) chmin(ans,p/i);
        }
    }
    cout << ans << endl;
    return;
}

int main(){
    int t;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}