//pypyの遅さをなめるなよ（）

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <random>
#include <stdio.h>
#include <fstream>
#include <functional>
#include <cassert>


using namespace std;


#define rep(i,n) for (int i=0;i<n;i+=1)
#define append push_back
#define all(x) (x).begin(), (x).end()

template<class T>
using vec = vector<T>;
template<class T>
using vvec = vec<vec<T>>;
template<class T>
using vvvec = vec<vvec<T>>;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;


template<class T>
bool chmin(T &a, T b){
  if (a>b){
    a = b;
    return true;
  }
  return false;
}

template<class T>
bool chmax(T &a, T b){
  if (a<b){
    a = b;
    return true;
  }
  return false;
}

template<class T>
T sum(vec<T> x){
  T res=0;
  for (auto e:x){
    res += e;
  }
  return res;
}

template<class T>
void printv(vec<T> x){
  for (auto e:x){
    cout<<e<<" ";
  }
  cout<<"\n";
}

template<class T>
ostream& operator<<(ostream& os, const vec<T>& A){
  os << "[";
  rep(i,A.size()){
    os << A[i];
    if (i!=A.size()-1){
      os << ", ";
    }
  }
  os << "]" ;
  return os;
}

template<class T>
ostream& operator<<(ostream& os, const deque<T>& A){
  os << "deque{[";
  rep(i,A.size()){
    os << A[i];
    if (i!=A.size()-1){
      os << ", ";
    }
  }
  os << "]}" ;
  return os;
}

template<class T>
ostream& operator<<(ostream& os, const pair<T,T>& A){
  os << "(";
  os << A.first ;
  os << ", ";
  os << A.second;
  os << ")";
  return os;
}

const ll M = 10000000;

ll mebius[M+1],phi[M+1];

void calc(){
  mebius[0] = 0;
  for (ll n=0;n<=M;n++){
    mebius[n] = 1ll, phi[n] = (ll)n;
  }
  for (ll p=2;p<=M;p++){
    if (phi[p]==p){
      for (ll k=p;k<=M;k+=p){
        mebius[k] *= -1ll;
        if (k%(p*p) == 0ll){
          mebius[k] = 0ll;
        }
      }
    }
    if (mebius[p]!=0ll){
      for (ll k=p;k<=M;k+=p){
        phi[k] += mebius[p] * (ll)(k/p);
      }
    }
  }
  for (int n=1;n<=M;n++){
    phi[n] += phi[n-1];
  }
}

int main() {

  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  calc();

  int T;
  cin>>T;
  while (T--){
    ll N;
    cin>>N;
    ll res = N*(N-1) - (phi[N]-1);
    cout << res << endl;
  }

  
       

}