#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
//#define int long long
#define all(a) a.begin(),a.end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef long double ld;
typedef complex<ld> com;
constexpr ll INF = 1000000000000000000;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.141592653589793238;
template<class T, class U> inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; }
ll gcd(ll n, ll m) { return (m ? gcd(m, n%m) : n); }

signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout << fixed << setprecision(20);

	int t;
	cin >> t;
	vector<bool> ok(40000);
	vector<int> use;
	for (int i = 2; i < 40000; i++) {
		if (!ok[i]) {
			use.pb(i);
			int st = i;
			while (st*i < 40000) {
				st *= i;
				ok[st] = true;
			}
		}
	}
	rep (_, t) {
		int n;
		cin >> n;
		ll ans = 2 * n * n - n;
		for (int i : use) {
			if (i > n) break;
			int cnt = 0; int ch = 1;
			while (ch * i <= n) {
				cnt++; ch *= i;
		    }
			for (int j = 1; j <= cnt; j++) {
				for (int k = 1; k <= cnt; k++) {
					if (j == k) continue;
					ans += n / (max(j, k) / gcd(j, k));
				}
			}
		}
		cout << ans << endl;
	}
}