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

typedef long long int ll;
#define IOS ios_base::sync_with_stdio(0);  cin.tie(0); cout.tie(0);

typedef pair<int,int>pr;
#define all(i)     i.begin() , i.end()
#define ft     first
#define sn     second
#define pb push_back


#define en "\n"
#define dbg cout<<"rony\n";

#define MAXN 100010
#define inf 1e8
const int mod = 1e9+7;

void solve()
{
  ll n;
  cin >> n;
  ll lst = n;
  ll an = 0;
   
  bool ok = false;
  ll i;
  vector<ll>v;
  ll mx = INT_MIN;
  ll mn = INT_MAX;

  for( i = 1;i*i <= n;i++)
  {
    ll d1 = n/i;
    v.pb(d1);
    v.pb(i);
    if(i*i == n) ok = true;
    an += d1;
    ll x = lst - d1;
    if(x >= 0){
        an += (x * (i-1LL)) ;
    }
    lst = d1;
    mx = max(mx,(i-1));
    mn = min(mn,d1);
   
  } 

  ll j = i;
  
  for(auto i:v){
    if(i > mx && i < mn){
       
        ll x = lst - (n/j);
        an += (x*(i));
    }
  }

  cout<<an<<en;
  
  
}
int main()
{
    IOS;
   int t;
   t = 1;
   
    cin >> t;
   int c = 0;
    while ( t-- )
    {
        //cout<<"Case "<<++c<<": ";
        solve();
    }
    return 0;
}