#include<stdio.h>
#include<math.h>
using namespace std;
int prim[70]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317};
int n,t,i;
int main()
{
    freopen("sum.in","r",stdin);freopen("sum.out","w",stdout);
    scanf("%d",&t);
    for(;t;t--)
    {
        scanf("%d",&n);int cn=n;
        int indeuler=1;
        for(i=0;i<66 && n>1;++i)
        {   int k=0;
            for(;n && n%prim[i]==0;k++,n/=prim[i]);
            if(k) indeuler*=(prim[i]-1)*pow(prim[i],k-1);
        }
        if(n>1) indeuler=n-1;
        printf("%lld\n",indeuler*cn*2*1LL);
    }
    fclose(stdin);fclose(stdout);
    return 0;
}