#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using mint = atcoder::modint998244353;

#define rep(i, l, r) for (int i = (int)(l); i<(int)(r); i++)
#define ll long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define siz(x) (int)(x).size()

template<class T> bool chmin(T& a, T b) { if (a > b) {a = b; return true;} return false; }
template<class T> bool chmax(T& a, T b) { if (a < b) {a = b; return true;} return false; }

const int inf = 1e9;
const ll INF = 4e18;

template<class T> using pq = priority_queue<T, vector<T>, less<T>>;
template<class T> using spq = priority_queue<T, vector<T>, greater<T>>;

vector<int> di = {0, 0, 1, -1};
vector<int> dj = {1, -1, 0, 0};

struct IoSetup {
    IoSetup() {
#ifdef LOCAL
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
#endif
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(15);
    }
} iosetup;

struct Edge {
    int to; ll cost;
};

template<class T>
T isqrt(T a) {
    for (T x = sqrt(a)+3; ; x--) {
        if (x * x <= a) return x;
    }
}
template<class T>
T icbrt(T a) {
    for (T x = cbrt(a) + 3; ; x--) {
        if (x * x * x <= a) return x;
    }
}

void solve() {
    ll N; cin >> N;
    ll sq = isqrt(N);
    ll cb = icbrt(N);
    int now = 1;
    if (sq * sq == N) now = 2;
    if (cb * cb * cb == N) now = 3;
    rep(a, 2, 1009) {
        int cnt = 0;
        ll cur = 1;
        while(cur < N) {
            cur *= a;
            cnt++;
        }
        if (cur == N) {
            now = max(now, cnt);
            break;
        }
    }
    cout << now << endl;
}

int main() {
    int T = 1;
    cin >> T;
    while(T--) {
        solve();
    }
}