// 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--;
    long long n;
    cin >> n;
    auto eq=Enu_quo(n);
    long long res=0;
    for(long long i=0;i<((long long)eq.size())-1;i++){
      res+=((n/eq[i])-(n/eq[i+1]))*eq[i];
    }
    cout << res << "\n";
  }
  return 0;
}