#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
const ll mod2 = 998244353;
const ld eps = 1e-10;
template<typename T1, typename T2> inline void chmin(T1 &a, T2 b){if(a>b) a=b;}
template<typename T1, typename T2> inline void chmax(T1 &a, T2 b){if(a<b) a=b;}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n; cin >> n;
  vector<ll> P(n); rep(i, n) cin >> P[i];
  rep(i, n) {
    ll tmp = 2;
    int x = 1;
    while(tmp < P[i]) {
      tmp *= 2;
      x++;
    }
    bool flag = true;
    while(tmp <= (ll)1e18) {
      if((tmp-x)%P[i]==0) {
        cout << x << endk;
        flag = false;
        break;
      }
      tmp *= 2;
      x++;
    }
    if(flag) cout << -1 << endk;
  }
  return 0;
}