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

#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()
#define sq(a) ((a)*(a))

#define MOO(i,a,b) for (int i=a; i<b; i++)
#define M00(i,a) for (int i=0; i<a; i++)
#define MOOd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define M00d(i,a) for (int i = (a)-1; i >= 0; i--)

#define per(i,a,b) for (int i = (b)-1; i >= a; i--)
#define rep(i,a,b) for (int i=a; i<b; i++)

#define FOR(i,a,b) for (int i=a; i<b; i++)
#define F0R(i,a) for (int i=0; i<a; i++)
#define ROF(i,a,b) for (int i = (b)-1; i >= a; i--)
#define R0F(i,a) for (int i = (a)-1; i >= 0; i--)

#define FAST ios::sync_with_stdio(0); cin.tie(0);
#define finish(x) return cout << x << endl, 0;
#define dbg(x) cerr << ">>> " << #x << " = " << x << endl;
#define _<< " _ " <<

#define ll long long

template<class T> bool ckmin(T&a, T&b) { bool B = a > b; a = min(a,b); return B; }
template<class T> bool ckmax(T&a, T&b) { bool B = a < b; a = max(a,b); return B; }

typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ld,ld> pld;
typedef complex<ld> cd;

typedef vector<int> vi;
typedef vector<ld> vld;
typedef vector<vector<int>> vvi;

const ld PI = acos(-1.0);
const ld EPS = 1e-7;
const int MOD = 998244353;

const int MX = 500000;
uint32_t ic[MX];

uint32_t innerpre(int x){
  assert (x > 0);

  uint32_t out = 0;
  uint32_t curr = 1;
  
  while (curr * curr < x){
      uint32_t val = (x - 1) / curr;
      out += val;
      curr ++;
  }

  while (curr <= x - 1){
    uint32_t val = (x - 1) / curr;
    uint32_t last = (x - 1) / val;

    out += val * (last - curr + 1);
    curr = last + 1;
  }

  return out;
}

ll inner(ll x){
  assert (x > 0);
  
  if (x < MX){
      return ic[x];
  }

  ll out = 0;
  ll curr = 1;

  while (curr * curr < x){
      ll val = (x - 1) / curr;
      out += val;
      curr ++;
  }

  while (curr <= x - 1){
    ll val = (x - 1) / curr;
    ll last = (x - 1) / val;

    out += val * (last - curr + 1);
    curr = last + 1;
  }

  return out;
}

ll solve(ll n){
  assert (n > 0);

  ll out = 0;
  ll curr = 1;
  
  while (curr * curr < n){
      ll val = n / curr;
      out += inner(val);
      curr ++;
  }

  while (curr <= n){
    ll val = (n) / curr;
    ll last = n / val;

    out += inner(val) * (last - curr + 1);
    curr = last + 1;
  }

  return out;
}

int32_t main() { FAST

  FOR(i, 1, MX){
      ic[i] = innerpre(i);
  }
  
  //cout << inner(1000000) << endl;

  int z;
  cin >> z;

  F0R(i, z){
    ll n;
    cin >> n;
    ll u = solve(n);

    cout << u << '\n';
  }
  
	return 0;
}