#include <cstdio>
using namespace std;
int v[100010],n,i,j,Max;
long long q[100010],sol;
int main()
{
    freopen("sum.in","r",stdin);
    freopen("sum.out","w",stdout);
    scanf("%d",&n);
    for (i=1;i<=n;++i)
    {
        scanf("%d",&v[i]);
        if(Max<v[i])
            Max=v[i];
    }
    for(i=2;i<=Max;++i)
        q[i]=i-1;
    for (i=2;i<=Max;++i)
    {
        for (j=2*i;j<=Max;j+=i)
        {
            q[j]-=q[i];
        }
    }
    for (i=1;i<=n;++i)
    {
        sol=2*q[v[i]]*v[i];
        printf("%lld\n",sol);
    }
    return 0;
}