#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <stack>
#include <array>
#include <list>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
ll powmod(ll a, ll k, ll MOD){
    ll ap=a, ans=1;
    while(k){
        if(k&1){
            ans*=ap;
            ans%=MOD;
        }
        ap=ap*ap;
        ap%=MOD;
        k>>=1;
    }
    return ans;
}
int main()
{
    int t; cin>>t;
    while(t--){
        ll n; cin>>n;
        while(n%2==0) n/=2;
        while(n%5==0) n/=5;
        if(n==1){
            cout<<1<<endl;
            continue;
        }
        ll phi=n;
        ll n1=n;
        for(int i=2; i*i<=n1; i++){
            if(n1%i==0){
                phi/=i;
                phi*=(i-1);
                while(n1%i==0) n1/=i;
            }
        }
        if(n1>1){
            phi/=n1;
            phi*=(n1-1);
        }
        vector<ll> v;
        for(int i=1; i*i<=phi; i++){
            if(phi%i==0){
                v.push_back(i);
                if(i*i<phi) v.push_back(phi/i);
            }
        }
        sort(v.begin(), v.end());
        for(auto x:v){
            if(powmod(10, x, n)==1){
                cout<<x<<endl;
                break;
            }
        }
    }
    return 0;
}