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

const int MAX_N = 1000000;
long long freq[MAX_N + 1];
long long answers[MAX_N + 1];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    // Initialize freq to 0
    memset(freq, 0, sizeof(freq));

    // Precompute freq: freq[n] = sum of floor(n/d) for d=1..n
    // Using divisor approach: for each i, add 1 to all multiples j of i
    for (int i = 1; i <= MAX_N; i++) {
        for (int j = i; j <= MAX_N; j += i) {
            freq[j]++;
        }
    }

    // Precompute answers
    for (int n = 1; n <= MAX_N; n++) {
        answers[n] = freq[n] - n;
    }

    int T; cin >> T;
    while (T--) {
        int N; cin >> N;
        cout << answers[N] << "\n";
    }

    return 0;
}