/****************************************************

     Author : Coolxxx

     Copyright 2017 by Coolxxx. All rights reserved.

     BLOG : http://blog.csdn.net/u010568270

 ****************************************************/

 #include<bits/stdc++.h>

 #pragma comment(linker,"/STACK:1024000000,1024000000")

 #define abs(a) ((a)>0?(a):(-(a)))

 #define lowbit(a) (a&(-a))

 #define sqr(a) ((a)*(a))

 #define mem(a,b) memset(a,b,sizeof(a))

 const double EPS=0.00001;

 const int J=;

 const int MOD=;

 const int MAX=0x7f7f7f7f;

 const double PI=3.14159265358979323;

 const int N=;

 const int M=;

 using namespace std;

 typedef long long LL;

 double anss;

 LL aans;

 int cas,cass;

 int n,m,lll,ans;

 int prime[M/],e[M/],div_num[M];         // e[i]表示第i个素数因子的个数

 bool flag[M];

 void get_prime()

 {

     int i,j,k;

     mem(flag,);

     k=;

     for(i=;i<M;i++)

     {

         if(!flag[i])

         {

             prime[k++]=i;

             e[i]=;

             div_num[i]=;                     //素数的约数个数为2

         }

         for(j=;j<k&&i*prime[j]<M;j++)

         {

             flag[i*prime[j]]=true;

             if(i%prime[j]==)

             {

                 div_num[i*prime[j]]=div_num[i]/(e[i]+)*(e[i]+);

                 e[i*prime[j]]=e[i]+;

                 break;

             }

             else

             {

                 div_num[i*prime[j]]=div_num[i]*div_num[prime[j]];

                 e[i]=;

             }

         }

     }

 }

 int main()

 {

     #ifndef ONLINE_JUDGE

 //    freopen("1.txt","r",stdin);

 //    freopen("2.txt","w",stdout);

     #endif

     int i,j,k;

     int x,y,z;

 //    for(scanf("%d",&cass);cass;cass--)

     for(scanf("%d",&cas),cass=;cass<=cas;cass++)

 //    while(~scanf("%d",&n))

     {

         scanf("%d",&n);

         n--;

         aans=;

         m=n;

         for(int q=;q*q<=n;q++)

         {

             x=;

             while(m%q==)

             {

                 m/=q;

                 x++;

             }

             aans*=x;

         }

         if(m!=)

             aans*=;

         cout<<aans<<endl;

     }

     return ;

 }

 /*

 //

 //

 */