#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};

int q;
map<int,bool> ng;

int gcd(int a,int b){
  if(a<b) swap(a,b);
  if(b==0) return a;
  return gcd(b,a%b);
}

void solve(){
  cin >> q;
  rep(_,q){
    ll n;cin >> n;
    ll m=0;
    ll ans=0;
    while(m*m<n){
      m+=1;
    }
    ng.clear();
    int cnt=0;
    Rep(x,2,m+1){
      if(ng[x]) continue; 
      int l=1;
      for(int y=x*x;y<=n;y*=x){
        l+=1;
        ng[y]=true;
        if(y>m) cnt+=1;
      }
      //cout << x << " " << l << endl;
      Rep(s,1,l+1){
        Rep(t,1,l+1){
          int g=gcd(s,t);
          int s_=s/g,t_=t/g;
          ans+=min(n/s_,n/t_);
        }
      }
    }
    //cout << ans << endl;
    ans+=(n-m-cnt)*n;
    ans+=n*n;
    cout << ans << endl;
  }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}