#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using mint = modint998244353;

map<ll, ll> mp;

ll divisors(ll n) {
  if (mp.count(n)) return mp[n];
  ll res = 0;
  for (ll i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      res++;
      if (i * i != n) res++;
    }
  }
  return mp[n] = res;
}

int main() {
  ll t; cin >> t;
  while (t--) {
    ll n; cin >> n;
    while (true) {
      ll s = divisors(n);
      if (n - s == 0) break;
      n -= s;
    }
    cout << n << endl;
  }
  return 0;
}