/* -*- coding: utf-8 -*-
 *
 * 1339.cc:  No.1339 循環小数 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_P = 32000;
const int INF = 1 << 30;

/* typedef */

typedef long long ll;

/* global variables */

bool primes[MAX_P + 1];
int pnums[MAX_P];

/* subroutines */

int gen_primes(int maxp, int pnums[]) {
  memset(primes, true, sizeof(primes));
  primes[0] = primes[1] = false;

  int p, pn = 0;
  for (p = 2; p * p <= maxp; p++)
    if (primes[p]) {
      pnums[pn++] = p;
      for (int q = p * p; q <= maxp; q += p) primes[q] = false;
    }
  for (; p <= maxp; p++)
    if (primes[p]) pnums[pn++] = p;
  return pn;
}

int powmod(int a, int n, int mod) {  // a^n % MOD
  int pm = 1;
  while (n > 0) {
    if (n & 1) pm = (ll)pm * a % mod;
    a = (ll)a * a % mod;
    n >>= 1;
  }
  return pm;
}

int phi(int n, int pn, int pnums[]) {
  int ph = 1;
  for (int i = 0, pi; (pi = pnums[i]) * pnums[i] <= n; i++)
    if (n % pi == 0) {
      ph *= pi - 1;
      n /= pi;
      while (n % pi == 0) ph *= pi, n /= pi;
    }
  if (n > 1) ph *= n - 1;
  return ph;
}

/* main */

int main() {
  int pn = gen_primes(MAX_P, pnums);
  //printf("pn=%d\n", pn);

  int tn;
  scanf("%d", &tn);

  while (tn--) {
    int n;
    scanf("%d", &n);

    while (n % 2 == 0) n /= 2;
    while (n % 5 == 0) n /= 5;

    if (n == 1) {
      puts("1");
      continue;
    }
    
    int phn = phi(n, pn, pnums);
    //printf("phi(%d)=%d\n", n, phn);

    int minp = INF;
    for (int p = 1; p * p <= phn; p++)
      if (phn % p == 0) {
	if (minp > p && powmod(10, p, n) == 1) minp = p;
	int q = phn / p;
	if (p != q && minp > q && powmod(10, q, n) == 1) minp = q;
      }

    printf("%d\n", minp);
  }
  return 0;
}