#include <iostream>
#include <string>
#include <vector>
#include <array>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <cassert>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

ll gcd(ll a, ll b){
  if(b<a) swap(a, b);
  ll r = a % b;
  if(r==0) return b;
  while(r!=0) r = a % b, a = b, b = r;
  return a;
}
ll lcm(ll a, ll b){return (a*b)/gcd(a, b);}
vll extgcd(ll a, ll b) {
  ll x, y;
  for (ll u = y = 1, v = x = 0; a;) {
    ll q = b / a;
    swap(x -= q * u, u);
    swap(y -= q * v, v);
    swap(b -= q * a, a);
  }
  return vll{x, y, b};
}
void solve(){
  ll n;std::cin >> n;
  ll ans = n * n + (n-1) * n;

  vll f(31, 0);
  f[1] = n;

  for(ll i=2;i<31;i++){
    ll cnt = 0;
    for(ll j=1;j<=n;j++){
      ll tmp = 1;
      for(ll k=0;k<i;k++){
        tmp *= j;
        if(tmp>n) break;
      }
      if(tmp<=n) cnt++;
      else break;
    }
    f[i] = cnt;
  }

  //a!=b
  for(ll i=1;i<31;i++){
    for(ll j=1;j<31;j++){
      if(i==j) continue;
      if(gcd(i, j)!=1) continue;
      ll base = min(f[i], f[j]);
      ll ml = max(lcm(i, j)/i, lcm(i, j)/j);
      ml = n / ml;
      if(base&&ml){
        ans += (base-1) * ml;
      }
    }
  }
  std::cout << ans << '\n';
}
int main(){
  // b = d -> N * N
  // b > d -> 2 *
  // A:= aのpのgcd, B:= cのpのgcd
  ll t;std::cin >> t;
  re(i, t) solve();
}