#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}


bool isPrime(ll num){
    if(num<2)           return false;
    else if(num==2)     return true;
    else if(num%2==0)   return false;
    for(ll i=3;i*i<=num;i+=2) if(num%i==0) return false;
    return true;
}

ll pow_mod(ll a,ll n,ll m){
    ll ret=1;
    while(n){
        if(n&1) ret=ret*a%m;
        a=a*a%m;
        n>>=1;
    }
    return ret;
}

template<typename T>
T mod_log(T a,T b,T MOD){
  using ll = long long;
  ll g=1;
  {
    ll m=MOD;
    while(m){
      g=(ll)g*a%MOD;
      m>>=1;
    }
  }
  g=__gcd(g,(ll)MOD);
  ll c=0,t=1;
  while(t%g){
    if(t==b) return c;
    t=t*a%MOD;
    c++;
  }
  // not found
  if(b%g) return MOD;
  t/=g;b/=g;
  const ll n=MOD/g;
  ll h=0,gs=1;
  while(h*h<n){
    gs=gs*a%n;
    ++h;
  }
  unordered_map<ll, ll> bs;
  {
    ll s=0,e=b;
    while(s<h){
      e=e*a%n;
      bs[e]=++s;
    }
  }
  ll ret=LINF;
  {
    ll s=0,e=t;
    while(s<n){
      e=e*gs%n;
      s+=h;
      if(bs.count(e)){
        //   cout<<c+s-bs[e]<<endl;
        // return c+s-bs[e];
        if(c+s-bs[e]>0) chmin(ret,c+s-bs[e]);
      }
    }
  }
  return ret;
}

vector<ll> divisor(ll n) {
    vector<ll> ret;
    for(ll i=1; i*i<=n; i++) {
        if(n % i == 0) {
            ret.push_back(i);
            if(n / i != i) ret.push_back(n/i);
        }
    }
    sort(ALL(ret));
    return ret;
}


void solve(){
    ll n;cin>>n;
    while(n%2==0) n/=2;
    while(n%5==0) n/=5;
    if(n==1){
        cout<<1<<endl;
        return ;
    }

    ll r=mod_log(10ll,1ll,n);
    if(r==LINF){
        cout<<1<<endl;
        return ;
    }


    for(auto x:divisor(r)){
        if(pow_mod(10,x,n)==1){
            cout<<x<<endl;
            return ;
        }
    }
}

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