#include<iostream>

 #include<algorithm>

 #include<cstring>

 #include<cstdio>

 #include<sstream>

 #include<vector>

 #include<stack>

 #include<queue>

 #include<cmath>

 #include<map>

 #include<set>

 using namespace std;

 typedef long long ll;

 typedef pair<int,int> pll;

 const int INF = 0x3f3f3f3f;

 const int maxn =  + ;

 bool check[maxn];

 int prime[maxn];

 int mu[maxn];

 ll sum[maxn];

 void Mobius()

 {

     memset(check, false, sizeof(check));

     mu[] = ;

     int tot = ;

     for (int i = ; i <= maxn; i++)

     {

         if (!check[i])

         {

             prime[tot++] = i;

             mu[i] = -;

         }

         for (int j = ; j < tot; j++)

         {

             if (i * prime[j] > maxn)

             {

                 break;

             }

             check[i * prime[j]] = true;

             if (i % prime[j] == )

             {

                 mu[i * prime[j]] = ;

                 break;

             }

             else

             {

                 mu[i * prime[j]] = -mu[i];

             }

         }

     }

     sum[]=;

     for(int i=;i<maxn;i++)

         sum[i]=sum[i-]+mu[i];

     return ;

 }

 ll compute1(int n)

 {

     ll tmp=;

     for(int i=,last=;i<=n;i=last+)

     {

         last=n/(n/i);

         tmp+=(sum[last]-sum[i-])*(n/i)*(n/i)*(n/i);

     }

     return tmp;

 }

 ll compute2(int n)

 {

     ll tmp=;

     for(int i=,last=;i<=n;i=last+)

     {

         last=n/(n/i);

         tmp+=(sum[last]-sum[i-])*(n/i)*(n/i);

     }

     return tmp;

 }

 int n, m;

 int main()

 {

     //freopen("in.txt","r",stdin);

     Mobius();

     int T;

     scanf("%d",&T);

     while(T--)

     {

         scanf("%d",&n);

         printf("%lld\n",compute1(n)+compute2(n)*+);

     }

     return ;

 }