#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,1,-1,0,1,1,-1,-1,0};
const ll dx[9]={1,0,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

vector<long long> divisor(long long n) {
    vector<long long> ret;
    for (long long i = 1; i * i <= n; i++) {
        if (n % i == 0) {
            ret.push_back(i);
            if (i * i != n) ret.push_back(n / i);
        }
    }
    sort(ret.begin(), ret.end()); // 昇順に並べる
    return ret;
}

ll modpow(ll a,ll n, ll mod) {
  ll res = 1;
  while (n > 0) {
      if (n & 1) res = res * a % mod;
      a = a * a % mod;
      n >>= 1;
  }
  return res;
}


ll calc(ll p){
    ll x=0,cnt=0;
    while(true){
        x*=10;x+=9;
        x%=p;cnt++;
        if(x==0)break;
    }
    return cnt;
}
map<ll,ll> factor(long long n) {
    map<ll,ll> mp;
    for (long long i = 2; i * i <= n; i++) {
        while(n%i==0){
            mp[i]++;n/=i;
        }
    }
    if(n!=1)mp[n]++;
    return mp;
}

ll calc2(ll p){
    vl div=divisor(p-1);
    for(auto d:div){
        ll k=modpow(10,d,p);
        if(k==1)return d;
    }
    return INF;
}
int main(){
    ll t;cin >> t;
    while(t--){
        ll n;cin >> n;
        //ll k=n;
        while(n%2==0)n/=2;
        while(n%5==0)n/=5;
        if(n==1){
            cout << 1 <<endl;
            continue;
        }
        auto mp=factor(n);
        ll ans=1;
        for(auto p:mp){
            ll ret=calc2(p.fi);
            rep(i,p.se-(p.fi==3||p.fi==487? 2:1))ret*=p.fi;
            ans=lcm(ans,ret);
            //cout << p.fi <<" " << calc(p.fi) <<" "<< calc(p.fi*p.fi) <<endl;
        }
        cout << ans <<endl;
    }
}