#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)

template <class T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <class T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

struct io_setup {
	io_setup() {
		ios::sync_with_stdio(false);
		cin.tie(nullptr);
		cout << fixed << setprecision(15);
	}
} io_setup;

void solve() {
	int q;
	cin >> q;
	vector<ll> a(q);
	rep(i, 0, q) cin >> a[i];
	map<ll, int> mp;
	rep(i, 0, q) mp[a[i]] = 1;
	for (ll d = 2; d <= 1e6; d++) {
		ll pw = d * d;
		for (int ct = 2;; ct++) {
			if (mp.count(pw)) {
				chmax(mp[pw], ct);
			}
			pw *= d;
			if (pw > 1e12) break;
		}
	}
	rep(i, 0, q) cout << mp[a[i]] << "\n";
}

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