#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <atcoder/all>

#define ALL(V) std::begin(V), std::end(V)

const int SIZE = 1e7 + 10;

using ll = long long;

int main() {
    std::vector<int> primes;
    {
        std::vector<bool> flags(SIZE);
        for (int i = 2; i < SIZE; i++) {
            if (flags[i]) continue;
            primes.push_back(i);
            for (int j = i; j < SIZE; j += i) flags[j] = true;
        }
    }

    std::vector<std::vector<std::pair<int, int>>> p_divs(SIZE);
    for (auto &v : p_divs) v.emplace_back(1, 0);
    for (auto p : primes) {
        for (int i = p; i < SIZE; i += p) {
            int sz = p_divs[i].size();
            for (int j = 0; j < sz; j++) {
                auto [ a, b ] = p_divs[i][j];
                p_divs[i].emplace_back(a * p, b + 1);
            }
        }
    }

    std::vector<int> non_disj(SIZE);
    for (int i = 1; i < SIZE; i++) {
        int tmp = 0;
        for (auto [ d, cnt ] : p_divs[i]) {
            if (d == 1 || d == i) continue;
            if (cnt % 2 == 1) tmp += (i - 1) / d;
            else tmp -= (i - 1) / d;
        }
        non_disj[i] = tmp;
    }

    std::vector<ll> sum(SIZE + 1);
    for (int i = 0; i < SIZE; i++) sum[i + 1] = sum[i] + non_disj[i];

    std::ios::sync_with_stdio(false);
    int T;
    std::cin >> T;
    while (T--) {
        ll N;
        std::cin >> N;
        ll ans = N * (N - 1) / 2;
        ans += sum[N + 1];
        std::cout << ans << '\n';
    }
    return 0;
}