#include <stdio.h>
#include <cstring>
#include <bitset>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <deque>
#define nmax 100010
using namespace std;
int n,i,j,x,sol[nmax];
long long soll;
int main(){
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
scanf("%d",&n);
for (j=1;j<=nmax;j++) sol[j]=j;
for (i=2;i<=nmax;i++)
    if (sol[i]==i) {
    for (j=i;j<=nmax;j+=i)
        sol[j]=sol[j]/i*(i-1);
}
for (i=1;i<=n;i++){
    scanf("%d",&x);
    soll=1LL*x*sol[x]*2;
    printf("%lld\n",soll);
}
return 0;
}