#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

const int N = 10000000;

int prime_fac[N+1];
bool is_prime[N+1];
ll ans[N+1];

void init(){
    for(int p = 2; p <= N; p++) is_prime[p] = true;
    for(int p = 2; p <= N; p++) {
        if(!is_prime[p]) continue;
        prime_fac[p] = p;
        for(int i = 2; i*p <= N; i++){
            prime_fac[i*p] = p;
            is_prime[i*p] = false;
        }
    }
    ans[1] = 0;
    for(int x = 2; x <= N; x++){
        int y = x;
        int tot = y;
        while(y > 1){
            int p = prime_fac[y];
            tot /= p;
            tot *= p-1;
            while(y%p == 0) y /= p;
        }
        ans[x] = ans[x-1]+(x-tot-1)+x-1;
    }
}

void solve(){
    ll n; cin >> n;
    cout << ans[n] << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    init();
    int t; cin >> t;
    while(t--) solve();
}