#include <bits/stdc++.h> 
#include <atcoder/all>
#define pub push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (ll i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (ll i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
using namespace std;
using namespace atcoder;
using ll = long long; using dd = double;
using Pll = pair<ll, ll>;
using    vll = vector<   ll>; using   vdd = vector< dd>;
using   vvll = vector<  vll>; using  vvdd = vector<vdd>;
using  vvvll = vector< vvll>; using vvvdd = vector<vvdd>;
using vvvvll = vector<vvvll>;
using  vchar = vector< char>;
using vvchar = vector<vchar>;
using mint = modint998244353;
using mint2 = modint1000000007;
using  vmint = vector< mint>; using  vmint2 = vector< mint2>;
using vvmint = vector<vmint>; using vvmint2 = vector<vmint2>;

constexpr long long INF = (1LL << 60);
constexpr double EPS = 1e-9;
constexpr double PI = 3.141592653589;

//////////////////////////////////////////////////////////

template <typename T>
bool chmax(T& a, const T& b) {
	if (a < b) {
		a = b;  // aをbで更新
		return true;
	}
	return false;
}

template <typename T>
bool chmin(T& a, const T& b) {
	if (a > b) {
		a = b;  // aをbで更新
		return true;
	}
	return false;
}

template <typename T>
T sq(T x) {
	return x * x;
}

std::string zfill(int n, const int width)
{
	std::stringstream ss;
	ss << std::setw(width) << std::setfill('0') << n;
	return ss.str();
}


vector<vector<ll>> prime_table(int n) {
	vector<bool> prime(n + 1, true);
	vector<vector<ll>> ans(n + 1);
	if (n >= 0) prime[0] = false;
	if (n >= 1) prime[1] = false;
	for (int i = 2; i <= n; i++) {
		if (!prime[i]) {
			continue;
		}
		ans[i].eb(i);
		for (int j = i + i; j <= n; j += i) {
			prime[j] = false;
			ans[j].eb(i);
		}
	}
	return ans;
}

//N未満でNと互いに素な数の個数
ll re_prime(ll N, vll a) {
	if (N == 1) {
		return 0;
	}
	ll n = a.size();
	ll ans = 0;
	rep(i, 1 << n) {
		bitset<20> s(i);
		ll now = 1;
		rep(j, n) {
			if (s.test(j)) {
				now *= a[j];
			}
		}
		if (s.count() % 2 == 0) {
			ans += N / now;
		}
		else {
			ans -= N / now;
		}
	}
	return ans;
}


int main() {
	//cout << fixed << setprecision(10);
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	vll ans(10000001);
	vvll A = prime_table(1e7);
	for (int i = 1; i <= 1e7; i++) {
		ll a = re_prime(i, A[i]);
		ll b = a + (i - 1 - a) * 2;
		if (i == 1) {
			ans[i] = b;
		}
		else {
			ans[i] = b + ans[i - 1];
		}
	}
	ll T; cin >> T;
	rep(z, T) {
		ll N; cin >> N;
		cout << ans[N] << endl;
	}
}