#include <bits/stdc++.h>

#ifdef DEBUG
#include <Mylib/Debug/debug.cpp>
#else
#define dump(...) ((void)0)
#endif

template <typename T, typename U>
bool chmin(T &a, const U &b){
  return (a > b ? a = b, true : false);
}

template <typename T, typename U>
bool chmax(T &a, const U &b){
  return (a < b ? a = b, true : false);
}

template <typename T, size_t N, typename U>
void fill_array(T (&a)[N], const U &v){
  std::fill((U*)a, (U*)(a + N), v);
}

template <typename T, size_t N, size_t I = N>
auto make_vector(const std::array<int, N> &a, T value = T()){
  static_assert(I >= 1);
  static_assert(N >= 1);
  if constexpr (I == 1){
    return std::vector<T>(a[N - I], value);
  }else{
    return std::vector(a[N - I], make_vector<T, N, I - 1>(a, value));
  }
}

template <typename T>
std::ostream& operator<<(std::ostream &s, const std::vector<T> &a){
  for(auto it = a.begin(); it != a.end(); ++it){
    if(it != a.begin()) s << " ";
    s << *it;
  }
  return s;
}

template <typename T>
std::istream& operator>>(std::istream &s, std::vector<T> &a){
  for(auto &x : a) s >> x;
  return s;
}

std::string YesNo(bool value){return value ? "Yes" : "No";}
std::string YESNO(bool value){return value ? "YES" : "NO";}
std::string yesno(bool value){return value ? "yes" : "no";}

template <typename T>
void putl(const T &value){
  std::cout << value << "\n";
}

template <typename Head, typename ... Tail>
void putl(const Head head, const Tail &... tail){
  std::cout << head << " ";
  putl(tail ...);
}

namespace haar_lib {
  constexpr int64_t mod_pow(int64_t n, int64_t p, int64_t m){
    int64_t ret = 1;
    while(p > 0){
      if(p & 1) (ret *= n) %= m;
      (n *= n) %= m;
      p >>= 1;
    }
    return ret;
  }
}

namespace haar_lib {
  int64_t mod_inv(int64_t a, int64_t m){
    int64_t b = m, u = 1, v = 0;

    while(b){
      int64_t t = a / b;
      a -= t * b; std::swap(a, b);
      u -= t * v; std::swap(u, v);
    }

    u %= m;
    if(u < 0) u += m;

    return u;
  }
}

namespace haar_lib {
  std::optional<int64_t> mod_log(int64_t a, int64_t b, int64_t m){
    if(b == 1) return 0;

    int64_t d = 0;

    while(1){
      if(auto g = std::gcd(a, m); g != 1){
        if(b % g != 0) return {};

        d += 1;
        m /= g;
        b /= g;
        (b *= mod_inv(a / g, m)) %= m;

        if(b == 1) return d;
      }else{
        break;
      }
    }

    const int64_t sq = std::sqrt(m) + 1;

    std::unordered_map<int64_t, int64_t> mp;
    {
      int64_t t = 1 % m;

      for(int i = 0; i < sq; ++i){
        if(mp.find(t) == mp.end()) mp[t] = i;
        (t *= a) %= m;
      }
    }

    {
      int64_t A = mod_pow(mod_inv(a, m), sq, m);
      int64_t t = b % m;

      for(int i = 0; i < sq; ++i){
        if(mp.find(t) != mp.end()){
          int64_t ret = i * sq + mp[t] + d;

          return ret;
        }

        (t *= A) %= m;
      }
    }

    return {};
  }
}


namespace haar_lib {}

namespace solver {
  using namespace haar_lib;

  constexpr int m1000000007 = 1000000007;
  constexpr int m998244353 = 998244353;

  void init(){
    std::cin.tie(0);
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed << std::setprecision(12);
    std::cerr << std::fixed << std::setprecision(12);
    std::cin.exceptions(std::ios_base::failbit);
  }

  int repeating_decimal(int N){
    while(N % 2 == 0) N /= 2;
    while(N % 5 == 0) N /= 5;

    if(N == 1){
      return 1;
    }

    return *mod_log(10, mod_inv(10, N), N) + 1;
  }

  void solve(){
    int T; std::cin >> T;
    while(T--){
      int N; std::cin >> N;
      std::cout << repeating_decimal(N) << "\n";
    }
  }
}

int main(){
  solver::init();
  while(true){
    try{
      solver::solve();
      std::cout << std::flush;
      std::cerr << std::flush;
    }catch(const std::istream::failure &e){
      break;
    }catch(...){
      break;
    }
  }
  return 0;
}