#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

using ull=unsigned long long;

void solve(){
    ull n;cin>>n;

    ull ans=n*n+(n-1)*n;
    set<ull> checked;
    for(ull i=2;i*i<=n;i++){
        if(checked.count(i)) continue;
        int k=1;
        ull pl=0;
        for(ull j=i*i;j<=n;j*=i) k++,checked.insert(j);
        for(ull x=1;x<=k;x++){
            for(ull y=x+1;y<=k;y++){
                ull l=lcm(x,y);
                ull an=n*x;
                pl+=2*(an/l);
            }
        }
        ans+=pl;
    }
    cout<<ans<<endl;
}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int q;cin>>q;
    while(q--) solve();
    return 0;
}