#include<bits/stdc++.h>
#define ll long long
#define N 100005
#define endl '\n'
using namespace std; 

bool isprime[N];
int prime[N];
int n=N;
int cnt;

void euler(){
    memset(isprime, true, sizeof(isprime));
    isprime[1] = false;
    for(int i = 2; i <= n; ++i){
        if(isprime[i]) prime[++cnt] = i;
        for(int j = 1; j <= cnt && i * prime[j] <= n; ++j){
            isprime[i * prime[j]] = false;
            if(i % prime[j] == 0) break;
        }
    }
}


int main(){
	euler();
	int T;
	cin>>T;
	while(T--){
		ll k;
		cin>>k;
		ll ans1=0,ans2=0,k1=k,k2=k+1;
		for(int i=1;prime[i]*prime[i]<=k;i++){
			if(k1%prime[i]==0){
//				cout<<"a "<<prime[i]<<endl;
				ans1++;
				while(k1%prime[i]==0)k1/=prime[i];
			}
		}
		for(int i=1;prime[i]*prime[i]<=k+1;i++){
			if(k2%prime[i]==0){
				ans2++;
				while(k2%prime[i]==0)k2/=prime[i];
			}
		}
		if(k1>1)ans1++;
		if(k2>1)ans2++;
		cout<<ans1+ans2<<endl;
	}
	return 0;
}