#include <bits/stdc++.h>

using namespace std;
#define int long long
#define x first
#define y second

using ull = uint64_t;
using ii = pair<int, int>;
using iii = pair<int, ii>;
// using i4 = tuple<int, int, int, int>;
using i4 = pair<ii, ii>;
using ll = long long;

const int inf = 0x3f3f3f3f3f3f3f3f;
const int mod = 998244353;

using ii = pair<int, int>;
using vi = vector<int>;

int fexp(int a, int b) {
  int ans = 1;
  while(b) {
    if(b & 1) ans = ans * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ans;
}

void solve() {
  int n;
  cin >> n;
  int ans = 0;
  int cnt = 0;
  for(int a = 1; a*a*a <= n; a++) {
    int k = n/a;
    // a = o primeiro
    for(int b = a;b*b < k; b++) {
      ans += (1 + 2*((k-1)/b - b));
      cnt++;
    }
    // a = o segundo
    for(int b = a+1; a*b < n/b; b++) {
        int k = n/b;
        ans += 2 * ((k-1)/a - b + 1); // c = b
    }
    for(int b = a; n/(a*b+1) > b; b++) {
        int k = n/(a*b+1);
        int tmp = k - b;
        if(a == b) ans += tmp;
        else ans += tmp + tmp;
    }
  }
  cout << ans << '\n';
//   cout << cnt << endl;
}

int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout << fixed << setprecision(10);
  int t = 1;
  cin >> t;
  for(int T = 1; T <= t; T++) {
    solve(); 
  }
  return 0;
}