#include <iostream>

using namespace std;

int nxt() {
	int x;
	cin >> x;
	return x;
}

void solve() {
	long long n;
	cin >> n;

	long long ans = 0;
	// (ab + 1)c <= n
	// 1) c > a, b
	for (long long a = 1; (a * a + 1) * a <= n; ++a) {
		for (long long b = a + 1; (a * b + 1) * b <= n; ++b) {
			ans += (n / (a * b + 1) - b) * 2;
		}
		ans += (n / (a * a + 1) - a);
	}
	// 2) max(a, b) >= c
	for (long long a = 1; a * a + 1 <= n; ++a) {
		for (long long c = 1; (a * max(a, c) + 1) * c <= n; ++c) {
			ans += ((n / c - 1) / a - max(a, c) + 1) * 2;
			if (a >= c) {
				--ans;
			}
		}
	}
	cout << ans << "\n";
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	int t = nxt();
	while (t--) {
		solve();
	}
	return 0;
}