// Arup Guha
// 6/15/2023
// Alternate Solution to Kattis Problem: Non-prime factors
// https://open.kattis.com/problems/nonprimefactors

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

const int MAX = 2000001;

int main() {

    // For fast I/O.
    cin.tie(0)->sync_with_stdio(0);

    vector<int> numP(MAX, 0);
    vector<int> numD(MAX, 1);

    // Like prime sieve.
    for (int i=2; i<MAX; i++) {

        // This answers whether or not i is prime.
        bool isP = numD[i]==1;

        // Update each item for which i is a divisor.
        for (int j=i; j<MAX; j+=i) {
            numD[j]++;
            if (isP) numP[j]++;
        }
    }

    int q;
    cin >> q;

    // Answer queries.
    for (int i=0; i<q; i++) {
        int x;
        cin >> x;
        cout << numD[x]-numP[x] << "\n";
    }

    return 0;
}