#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;
typedef pair<int, int> P;

vector<ll> prime_facs(ll n){
    ll cur = n;
    vector<ll> ans;
    for(ll i = 2; i*i <= n; i++){
        if(cur%i == 0){
            int cnt = 0;
            while(cur%i == 0) {
                cur /= i;
                cnt++;
            }
            ans.push_back(i);
        }
    }
    if(cur != 1) ans.push_back(cur);
    return ans;
}

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


template <typename T>
T pow(T a, ll n, ll MOD) {
	T ans = 1;
	T tmp = a;
	for (int i = 0; i <= 60; i++) {
		ll m = (ll)1 << i;
		if (m & n) {
		ans *= tmp;
		ans %= MOD;
		}
		tmp *= tmp;
		tmp %= MOD;
	}
	return ans;
}


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 tot = n;
    auto f = prime_facs(n);
    for(ll x : f){
        tot /= x;
        tot *= (x-1);
    }
    auto v = facs(tot);
    ll ans = 1e10;
    // cout << tot << ' ' << n << endl;
    assert(pow<ll>((ll)10, tot, n) == 1);
    for(ll x : v){
        if(pow<ll>(10, x, n) == 1) chmin(ans, x);
    }
    cout << ans << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int t; cin >> t;
    for(int i = 0; i < t; i++) solve();
}