水题水题
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<map>
#include<set>
#include<vector>
#include<cstring>
using namespace std;
int n,l[105];
int main() {
//freopen("in.txt", "r", stdin);
int t,ans;
while(scanf("%d",&t) != EOF) {
while(t--) {
cin >> n;
memset(l, 0, sizeof(l));
for(int i = 1; i <= n; i++) {
for(int j = i; j <= n; j += i) {
l[j] = !l[j];
}
}
ans = 0;
for(int i = 1; i <= n; i++) if(l[i]) ans++;
cout << ans << endl;
}
}
return 0;
}