#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

std::vector<int> num;

void init(int n) {
	num.assign(30, 0);
	num[1] = n;
	for (int i = 2; i < 30; i++) {
		for (int j = 2; ; j++) {
			int cur = 1;
			bool ok = true;
			for (int k = 0; k < i; k++) {
				if ((int64_t) cur * j > n) {
					ok = false;
					break;
				}
				cur *= j;
			}
			if (ok) num[i]++;
			else break;
		}
	}
}

int gcd(int a, int b) {
	while (a && b) {
		if (a > b) a %= b;
		else b %= a;
	}
	return a + b;
}

void solve() {
	int n = ri();
	init(n);
	int64_t res = 0;
	res += (int64_t) n * n; // x, x
	res += (int64_t) n * n;
	res -= n;
	for (int i = 2; i < 30 && i <= n; i++) for (int j = 1; j < i; j++) {
		if (gcd(i, j) != 1) continue;
		res += (int64_t) num[i] * (n / i) * 2;
	}
	printf("%" PRId64 "\n", res);
}

int main() {
	int t = ri();
	for (int i = 0; i < t; i++) solve();
	return 0;
}