#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

template <typename T>
std::vector<std::pair<T, int>> prime_factorization(T val) {
  std::vector<std::pair<T, int>> res;
  for (T i = 2; i * i <= val; ++i) {
    if (val % i != 0) continue;
    int exponent = 0;
    while (val % i == 0) {
      ++exponent;
      val /= i;
    }
    res.emplace_back(i, exponent);
  }
  if (val != 1) res.emplace_back(val, 1);
  return res;
}

long long euler_phi(long long val) {
  assert(val >= 1);
  long long res = val;
  for (long long i = 2; i * i <= val; ++i) {
    if (val % i == 0) {
      res -= res / i;
      while (val % i == 0) val /= i;
    }
  }
  if (val > 1) res -= res / val;
  return res;
}

template <typename T>
std::vector<T> divisor(T val) {
  std::vector<T> res;
  for (T i = 1; i * i <= val; ++i) {
    if (val % i == 0) {
      res.emplace_back(i);
      if (i * i != val) res.emplace_back(val / i);
    }
  }
  std::sort(res.begin(), res.end());
  return res;
}

long long mod_pow(long long base, long long exponent, int mod) {
  base %= mod;
  long long res = 1;
  while (exponent > 0) {
    if (exponent & 1) (res *= base) %= mod;
    (base *= base) %= mod;
    exponent >>= 1;
  }
  return res;
}

int main() {
  map<int, int> mp;
  auto f = [&](int p) {
    if (mp.count(p) == 1) return mp[p];
  };
  int t; cin >> t;
  while (t--) {
    int n; cin >> n;
    int k = 1;
    for (auto [p, e] : prime_factorization(n)) {
      if (p != 2 && p != 5) {
        REP(_, e) k *= p;
      }
    }
    if (k == 1) {
      cout << 1 << '\n';
    } else {
      for (int ans : divisor(euler_phi(k))) {
        if (mod_pow(10, ans, k) == 1) {
          cout << ans << '\n';
          break;
        }
      }
    }
  }
  return 0;
}