#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define all(x) (x).begin(),(x).end()
#define inf 1e18

using namespace std;

typedef long long llint;
typedef long long ll;
typedef pair<llint, llint> P;

ll T;
ll n, mod;

llint modpow(llint a, llint n)
{
	if(n == 0) return 1;
	if(n % 2){
		return ((a%mod) * (modpow(a, n-1)%mod)) % mod;
	}
	else{
		return modpow((a*a)%mod, n/2) % mod;
	}
}

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> T;
	while(T--){
		cin >> n;
		
		while(n % 5 == 0) n /= 5;
		while(n % 2 == 0) n /= 2;
		
		if(n == 1){
			cout << 1 << endl;
			continue;
		}
		
		int res = n, t = n;
		for(int i = 2; i*i <= t; i++){
			if(t % i == 0){
				res = res / i * (i-1);
				for(; t % i == 0; t /= i);
			}
		}
		if(t != 1) res = res / t * (t-1);
		
		ll ans = inf; mod = n;
		for(llint i = 1; i*i <= n; i++){
			if(res % i == 0){
				if(modpow(10, i) == 1) chmin(ans, i);
				if(modpow(10, res/i) == 1) chmin(ans, res/i);
			}
		}
		cout << ans << endl;
	}
	
	return 0;
}