#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int T,N;
ll modpow(ll a, ll n,ll mo) {
	ll r=1;a%=mo;
	while(n) r=r*((n%2)?a:1)%mo,a=a*a%mo,n>>=1;
	return r;
}

int hoge(int x) {
	int mi=x-1;
	int y=N-1,i;
	for(i=1;i*i<=y;i++) if(y%i==0) {
		if(modpow(10,i,x)==1) mi=min(mi,i);
		if(modpow(10,y/i,x)==1) mi=min(mi,y/i);
	}
	return mi;
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>T;
	while(T--) {
		cin>>N;
		while(N%2==0) N/=2;
		while(N%5==0) N/=5;
		if(N==1) {
			cout<<1<<endl;
			continue;
		}
		int mi=1;
		x=N;
		for(i=2;i*i<=x;i++) if(x%i==0) {
			y=1;
			while(x%i==0) y*=i,x/=i;
			mi*=hoge(y);
		}
		if(x>1) mi*=hoge(x);
		cout<<mi<<endl;
		
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}