Problem: You are given n positive integers a1, a2, ..., an.

For every ai you need to find a positive integer ki such that the decimal notation of 2ki contains the decimal notation of ai as a substring among its last min(100, length(2ki)) digits. Here length(m) is the length of the decimal notation of m.

Note that you don't have to minimize ki. The decimal notations in this problem do not contain leading zeros.

Input

The first line contains a single integer n (1 ≤ n ≤ 2 000) — the number of integers ai.

Each of the next n lines contains a positive integer ai (1 ≤ ai < 1011).

Output

Print n lines. The i-th of them should contain a positive integer ki such that the last min(100, length(2ki)) digits of 2ki contain the decimal notation of ai as a substring. Integers ki must satisfy 1 ≤ ki ≤ 1050.

It can be shown that the answer always exists under the given constraints. If there are multiple answers, print any of them.

Examples

Input

2
8
2


Output

3
1


Input

2
3
4857


Output

5
20

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
int getLength(long long n) {
  int c = 0;
  while (n > 0) {
    c += 1;
    n /= 10;
  }
  return c;
}
long long m10 = 10000000;
struct Hash {
  static const size_t sz = 1e6;
  vector<vector<unsigned long long> > v;
  Hash() { v.resize(sz); }
  void insert(unsigned long long x) { v[x % sz].push_back(x); }
  bool find(unsigned long long x) {
    for (unsigned long long y : v[x % sz])
      if (y == x) return true;
    return false;
  }
};
inline long long mul(long long a, long long b, long long mod) {
  long long ans = 0;
  while (b > 0) {
    if (b & 1) {
      ans = ans + a;
      if (ans >= mod) ans -= mod;
    }
    b >>= 1;
    a <<= 1;
    if (a >= mod) a -= mod;
  }
  return ans;
}
long long pow_(long long a, long long n, long long mod) {
  long long ans = 1;
  while (n > 0) {
    if (n & 1) ans = mul(ans, a, mod);
    n >>= 1;
    a = mul(a, a, mod);
  }
  return ans;
}
long long solve(long long g, long long y, long long p, long long i) {
  long long P = 1;
  for (int j = 0; j < (i); ++j) P *= p;
  y %= P;
  if (i == 1) {
    long long ans = 1;
    for (int j = 0; j < (p); ++j) {
      if (ans == y) return j;
      ans = ans * g % p;
    }
    assert(0);
  }
  long long phi = 1;
  for (int j = 0; j < (i - 2); ++j) phi *= p;
  phi *= (p - 1);
  long long x = solve(g, y, p, i - 1);
  long long c = pow_(g, phi, P);
  long long ans = pow_(g, x, P);
  for (int j = 0; j < (p); ++j) {
    if (ans == y) return x + phi * j;
    ans = mul(ans, c, P);
  }
  assert(0);
}
void solve(long long x) {
  int n = getLength(x);
  int m = 7;
  long long y = x * m10 / (1ll << (n + m));
  while (y * (1ll << (n + m)) < x * m10 || y % 5 == 0) ++y;
  assert(y * (1ll << (n + m)) > x * m10);
  assert(y * (1ll << (n + m)) - x * m10 < m10);
  long long ans1 = solve(2, y, 5, n + m) + n + m;
  cout << ans1 << "\n";
}
int main() {
  int T = 20;
  scanf("%d", &T);
  while (T--) {
    long long n = (rand() * 1ll * rand()) % (long long)(1e11) + 1;
    scanf("%lld", &n);
    solve(n);
  }
  return 0;
}