#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

const long double EPS = 1e-10;
const long long INF = 1e18;
const long double PI = acos(-1.0L);
//const ll mod = 1000000007;

bool ok(ll x) {
    vector<ll> v;
    for(ll i = 2; i * i <= x; i++) {
        if(x % i == 0) {
            v.push_back(0);
            while(x % i == 0) {
                v.back()++;
                x /= i;
            }
        }
    }
    //if(x != 1) v.push_back(1);
    if(x != 1) return true;
    ll g = 0;
    for(auto val : v) {
        g = __gcd(val, g);
    }
    return g == 1;
}

ll N;

ll g(ll x) {
    ll ret = 0;
    for(ll i = 1; i <= x; i++) {
        for(ll j = 1; j <= x; j++) {
            ll g = __gcd(i, j);
            ll M = max(i, j);
            ll m = min(i, j);
            M /= g;
            m /= g;
            ret += N / M;
        }
    }
    return ret;
}

void solve() {
    cin >> N;
    ll ans = N * N;
    ll Total = N - 1;
    for(ll i = 2; i * i <= N; i++) {
        if(ok(i)) {
            //cerr << i << endl;
            ll num = 0;
            for(ll j = i; j <= N; j *= i) {
                num++;
            }
            Total -= num;
            //cerr << i << " " << num << " " << g(num) << endl;
            ans += g(num);
        }
    }
    //cerr << Total << endl;
    ans += Total * N;
    cout << ans << endl;
}

int main() {
    //cout.precision(10);
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll T;
    cin >> T;
    while(T--) solve();
    return 0;
}