// #pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

// Based on:
// https://judge.yosupo.jp/submission/179750
// Enumerate Quotients
// https://judge.yosupo.jp/problem/enumerate_quotients
#include<bits/stdc++.h>

using namespace std;

// vector<long long> Enu_quo(long long n){
//   vector<long long> head;
//   vector<long long> tail;
//   for(long long i=1;i*i<=n;i++){
//     head.push_back(i);
//     tail.push_back(n/i);
//   }
//   if(head.back()==tail.back()){tail.pop_back();}
//   for(long long i=tail.size()-1;i>=0;i--){head.push_back(tail[i]);}
//   return head;
// }

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int t;
  cin >> t;
  while(t>0){
    t--;
    int n;
    cin >> n;

    vector<int> head;
    vector<int> tail;
    for(int i=1;i*i<=n;i++){
      head.push_back(i);
      tail.push_back(n/i);
    }
    if(head.back()==tail.back()){tail.pop_back();}
    for(int i=tail.size()-1;i>=0;i--){head.push_back(tail[i]);}

    long long res=0;
    for(int i=0;i<((long long)head.size())-1;i++){
      long long del=((n/head[i])-(n/head[i+1]));
      del*=head[i];
      res+=del;
    }
    cout << res << "\n";
  }
  return 0;
}