#include #define rep(i, n) for (int i = 0; i < (n); ++i) using namespace std; using ll = long long; void solve() { ll p; cin >> p; ll temp = 1; rep(i, 60) { temp *= 2; temp %= p; if (temp == (i + 1) % p) { cout << i + 1 << "\n"; return; } } cout << -1 << endl; } int main() { ll N; cin >> N; rep(i, N) { solve(); } return 0; }