#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;

long long mod_inv_extgcd(long long a, int mod) {
  a %= mod;
  if (std::__gcd(a, static_cast<long long>(mod)) != 1) return -1;
  long long b = mod, x = 1, y = 0;
  while (b > 0) {
    long long tmp = a / b;
    std::swap(a -= tmp * b, b);
    std::swap(x -= tmp * y, y);
  }
  x %= mod;
  return x < 0 ? x + mod : x;
}

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 mod_log(long long g, long long y, int mod) {
  if ((g %= mod) < 0) g += mod;
  if ((y %= mod) < 0) y += mod;
  if (mod == 1) return 0;
  if (g == 0) {
    if (y == 1) {
      return 0;
    } else if (y == 0) {
      return 1;
    } else {
      return -1;
    }
  }
  int root = std::ceil(std::sqrt(mod));
  std::map<long long, int> baby;
  long long p = 1;
  for (int i = 0; i < root; ++i) {
    if (p == y) return i;
    baby[p * y % mod] = i;
    (p *= g) %= mod;
  }
  long long brute_force = p;
  for (int i = root; i < 100; ++i) {
    if (i == mod) return -1;
    if (brute_force == y) return i;
    (brute_force *= g) %= mod;
  }
  long long giant = p;
  for (int i = 1; i <= root; ++i) {
    if (baby.count(giant) == 1) {
      int ans = static_cast<int>(static_cast<long long>(i) * root - baby[giant]);
      if (mod_pow(g, ans, mod) == y) return ans;
    }
    (giant *= p) %= mod;
  }
  return -1;
}

int main() {
  int t; cin >> t;
  while (t--) {
    int n; cin >> n;
    while (n % 2 == 0) n /= 2;
    while (n % 5 == 0) n /= 5;
    cout << mod_log(10, mod_inv_extgcd(10, n), n) + 1 << '\n';
  }
  return 0;
}