#include<iostream> 
#include<fstream> 
#define maxn 100005 
using namespace std; 
  
ifstream f("sum.in"); 
ofstream g("sum.out"); 
  
  
int i,j,m,n; 
int phi[maxn];
  
  
int main() 
{
f>>n;

  for (int i = 1; i < maxn; ++i)
        phi[i] = i - 1;
    for (int i = 2; i < maxn/ 2; ++i)
        if (phi[i] == i - 1)
            for (int j = i * 2; j < maxn; j += i)
                phi[j] -= phi[j] / i;
while(n>0) 
        { 
        f>>i; 
        g<<(long long)2*phi[i]*i<<'\n'; 
        n--; 
        } 
g.close(); 
return 0; 
}