#include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <queue>
#include <set>
#include <map>
#include <limits>
#include <cmath>
#include <iomanip>
#include <functional>
#include <random>
#include <set>
#include <atcoder/string>
#include <unordered_map>
#include <climits>
#include <atcoder/lazysegtree>

using namespace std;
using ll = long long;
using namespace atcoder;

vector< int > euler_phi_table(int n) {
  vector< int > euler(n + 1);
  for(int i = 0; i <= n; i++) {
    euler[i] = i;
  }
  for(int i = 2; i <= n; i++) {
    if(euler[i] == i) {
      for(int j = i; j <= n; j += i) {
        euler[j] = euler[j] / i * (i - 1);
      }
    }
  }
  return euler;
}

int solve()
{
    ll N;
    cin >> N;
    vector<ll> A(N);
    vector<ll> B(N);
    set<pair<ll,pair<ll,ll>>> data;
    for(int i = 0;i < N;i++){
        cin >> A[i];
    }
    for(int i = 0;i < N;i++){
        cin >> B[i];
        if (A[i] > B[i]){
            swap(A[i],B[i]);
        }
        data.insert({B[i],{A[i],B[i]}});
    }
    ll ans = numeric_limits<ll>::max();
    while(true){
        ans = min(ans,data.rbegin()->first - data.begin()->first);
        auto p = *data.rbegin();
        if (p.first == p.second.first){
            break;
        }else if (p.first == (p.second.first + p.second.second)/2){
            data.insert({p.second.first,p.second});
        }else{
            data.insert({(p.second.first + p.second.second)/2,p.second});
        }
        data.erase(p);
    }
    cout << ans << endl;
    return 0;
}
int main()
{
    vector<int> phi_table = euler_phi_table(10000000);
    vector<ll> cumSum(10000001);
    for(int i = 1;i <= 10000000;i++){
        if (i == 1){
            cumSum[i] = cumSum[i-1] + phi_table[i]-1 + (i-phi_table[i])*2;
        }else{
            cumSum[i] = cumSum[i-1] + phi_table[i] + (i-1-phi_table[i])*2;
        }

    }
    ll T;
    cin >> T;
    while (T--)
    {
        ll N;
        cin >> N;
        cout << cumSum[N] << endl;
    }
    cout << flush;
    return 0;
}