#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;

typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef pair<ll, ll> LP;
typedef vector<int> vec;
typedef vector<string> svec;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-8;

#define int long long

const int mn = 100000;
bool isok[mn + 1];
int ans[mn + 1];
void init() {
	rep1(i, mn) {
		int k = sqrt(i + 0.01);
		int pro = 1;
		rep1(j, k) {
			if (i%j == 0) {
				if (j == (i / j)) {
					if (j != i) {
						pro = pro * j;
						if (pro > 2 * mn)pro = 2 * mn + 1;
					}
				}
				else {
					if (j != i) {
						pro = pro * j;
						if (pro > 2 * mn)pro = 2 * mn + 1;
					}
					if ((i / j) != i) {
						pro = pro * (i/j);
						if (pro > 2 * mn)pro = 2 * mn + 1;
					}
				}
			}
		}
		isok[i] = (pro >= 2 * i);
	}
	rep1(i, mn) {
		ans[i] = ans[i - 1];
		if (isok[i])ans[i]++;
	}
}
void solve() {
	init();
	int q; cin >> q;
	rep(i, q) {
		int n; cin >> n; cout << ans[n] << endl;
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	//cout << fixed << setprecision(10);
	//init();
	solve();
	//stop
	return 0;
}

