#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, limit) for (long long i = (long long)x; i < (long long)limit; i++)
#define REP(i, x, limit) for (long long i = (long long)x; i <= (long long)limit; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el endl
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )
#define debug(x) cerr << #x << " = " << x << el
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
using vb = vector<bool>;
const double pi = 3.141592653589793238;
const int inf = 1073741823;
const ll infl = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
const ll MOD = 998244353;
#include<atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using vm = vector<mint>;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll t;cin>>t;
  unordered_map<ll,ll>memo;
  auto dfs=[&](auto &&f,ll x)->ll{
    if(memo.count(x))return memo[x];
    if(x>10){
      memo[x]=2;
      return 2;
    }
    ll cnt=0;
    for(ll i=1;i*i<=x;i++){
      if(x%i==0){
        if(i*i==x)cnt++;
        else cnt+=2;
      }
    }
    if(cnt==x){
      memo[x]=cnt;
      return cnt;
    }
    memo[x]=f(f,x-cnt);
    return memo[x];
  };
  while(t--){
    ll n;cin>>n;
    cout<<dfs(dfs,n)<<el;
  }
}