#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

void solve() {
  ll n;
  cin >> n;
  rrep(d,40,2) {
    int ok = 0, ng = 1000010;
    while(ng-ok > 1) {
      int mid = (ok+ng)/2;
      ll x = 1;
      rep(i,0,d) {
        x = min(n+1, x*mid);
      }
      if (x <= n) ok = mid;
      else ng = mid;
    }
    ll val = 1;
    rep(i,0,d) val *= ok;
    if (val == n) {
      cout << d << endl;
      return;
    }
  }
  cout << 1 << endl;
}

int main() {
  int q;
  cin >> q;
  while(q--) solve();
  return 0;
}