#include<bits/stdc++.h>
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int) (x).size()
#define pb push_back
#define fi first
#define se second

using namespace std;

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef long double LD;

const int MI = 111, MN = (int)1e6+5;

int dp[MN][MI];
VI D[MN];

void prep()
{
	for(int i = 1; i < MN; ++i)
		for(int j = i; j < MN; j += i)
			D[j].pb(i);
	for(int i = 1; i < MN; ++i)
		for(auto dz : D[i])
		{
			int a = dz;
			int b = i / a;
			if(a < b)
				dp[i][min(a, MI - 1)]++;
		}
	for(int i = 1; i < MN; ++i)
	{
		int curSuma = 0;
		for(int j = MI - 1; j > 0; --j)
		{
			curSuma += dp[i][j];
			dp[i][j] = dp[i - 1][j] + curSuma;
		}
	}
}

void solve()
{
	int n;
	scanf("%d", &n);
	LL res = 0LL;
	for(int c = 1; c < MI - 1; ++c)
		res += dp[n / c][c + 1];
	printf("%lld\n", res);
}

int main()
{
	prep();
	int t;
	scanf("%d", &t);
	while(t--)
		solve();
	return 0;
}