/*
 * ============================
 * @Author: feng_Lrefrain
 * @DateTime: 2024-11-13 14:41:05
 * ============================
 */
#include <bits/stdc++.h>
#define int long long
#define vi vector<int>
#define pii pair<int,int>
#define fi first
#define se second
#define pb push_back
#define rep(I,S,N) for(int I=(S);I<(N);++I)
#define per(I,S,N) for(int I=(N)-1;I>=(S);--I)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef double db;
//int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
//inline ll gcd(ll a,ll b) {return b?gcd(b,a%b):a;}
//inline ll lcm(ll a,ll b) {return a/gcd(a,b)*b;}
//inline ll ksm(ll a,ll b,ll p) {ll ans=1;while(b){if(b&1)ans=(ans*a)%p;b>>=1;a=(a*a)%p;}return ans%p;}
//inline ll lowbit(int x) {return x&(-x);}
//inline int read() {
//    int x = 0;
//    char ch = getchar();
//    while (ch < '0' || ch > '9') ch = getchar();
//    while (ch <= '9' && ch >= '0') {
//        x = (x << 1) + (x << 3) + (ch ^ 48);
//        ch = getchar();
//    }
//    return x;
//}
const int N = 1e6 + 10, M = 998244353, MM = 1e9 + 7, inf = 1e18;

int cnt, primes[N];
bool st[N];
void get_primes(int n) {
	for (int i = 2; i <= n; ++ i) {
		if (!st[i]) primes[cnt ++] = i;
		for (int j = 0; primes[j] <= n / i; ++ j) {
			st[primes[j] * i] = true;
			if (primes[j] % i == 0) break; 
		}
	}
}
set<int> ans;
void func(int a) {
	ans.clear();
    for (int i = 1; i <= a / i; ++ i) {
        if (a % i == 0) {
            ans.insert(i);
            if (i != a / i) ans.insert(a / i);
        }
    }
}

void solve() {
	int n, sum = 0; cin >> n;
	if (!st[n]) cout << n * (n - 1) + 1 << '\n';
	else {
		int tmp = 1;
		func(n);
		for (const auto &i : ans) {
			if (i == 1) {
				continue;
			}
			if (i == n) break;
			if (tmp == 1) sum += (i - tmp) * n;
			else {
				sum += (i - tmp) * (n / tmp);
			}
			tmp = i;
			// cout << sum << " " << i << " " << tmp << '\n';
		}
		sum += (n - 1 - tmp + 1) * (n / tmp) + 1;
		cout << sum << '\n';
	}
}
/*


*/
signed main() {
	cin.tie(nullptr)->sync_with_stdio(false);
	get_primes(N);
	int _ = 1;
	cin >> _;
	while (_ --) {
		solve();
	}
	return 0;
}