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

unordered_map<long long,long long> mp;

long long say(long long N) {
    long long sum = 0;
    int c=0;
    for (long long i = 1; i <= N;) {
        long long q = N / i;
        long long j = N / q;
        sum += q * (j - i + 1);
        i = j + 1;
    }
    return sum;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int t;
    cin>>t;

    while(t--)
    {
        long long n;
        cin>>n;
        unordered_map<long long,long long>:: iterator it=mp.find(n);
        if(it==mp.end())
        {
            long long T=say(n)-n;
            mp[n]=T;
            cout<<T<<"\n";
        }
        else cout<<it->second<<"\n";
    }

    return 0;
}