#include <bits/stdc++.h>
using namespace std;
long long n , phi[100005];
int main()
{
    freopen("sum.in","r",stdin);
    freopen("sum.out","w",stdout);

    scanf("%lld", &n);
    for (long long i = 1; i<=1e5; ++i)
        phi[i] = i;
    for (long long i = 2; i<=1e5; ++i)
        if (phi[i] == i)
            for (long long j = i; j<=1e5; j+=i)
                phi[j] = (phi[j] /  i )* (i-1);
    for ( ; n; --n)
    {
        long long x;
        scanf("%lld", &x);
        printf("%lld\n", 2 * x * phi[x]);
    }
    return 0;
}