/* -*- coding: utf-8 -*-
 *
 * 3236.cc:  No.3236 邏ｯ荵玲焚螟ｧ螂ｽ縺甲ot - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>
#include<numeric>

using namespace std;

/* constant */

const int MAX_P = 1000050;

/* typedef */

using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;

/* global variables */

vb primes;
vi pnums;

/* subroutines */

int gen_primes(int maxp) {
  primes.assign(maxp + 1, true);
  primes[0] = primes[1] = false;

  int p;
  for (p = 2; p * p <= maxp; p++)
    if (primes[p]) {
      pnums.push_back(p);
      for (int q = p * p; q <= maxp; q += p) primes[q] = false;
    }
  for (; p <= maxp; p++)
    if (primes[p]) pnums.push_back(p);
  return (int)pnums.size();
}

/* main */

int main() {
  gen_primes(MAX_P);
  
  int tn;
  scanf("%d", &tn);

  while (tn--) {
    ll n;
    scanf("%lld", &n);

    int g = 0;
    for (auto p: pnums) {
      if ((ll)p * p > n) {
	if (n > 1) g = 1;
	break;
      }
      if (n % p == 0) {
	int di = 1;
	n /= p;
	while (n % p == 0) di++, n /= p;
	g = gcd(g, di);
      }
    }

    printf("%d\n", g);
  }

  return 0;
}