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

void solve(){
  long long n;
  cin >> n;
  long long mid = sqrt(1e9);
  long long ans = 0;
  for(int i = 1 ; i <= min(mid,n) ; i++){
    ans += n / i - 1;
  }
  if(n <= mid){
    cout << ans << endl;
    return;
  }
  int j = mid + 1;
  while(n / mid == n / j){
    ans += n / j - 1;
    j++;
  }
  for(int i = (n / j) ; i >= 1 ; i--){
    ans += i * max(0ll,n / i - max(mid+1,n / (i + 1)));
  }
  cout << ans - (n - j + 1) << endl;
}



 
 
 
 
int main()
{
    int t = 1;
    cin >> t;
    while(t--) solve();
    return 0;
}