威尔逊定理:当p为质数时,(p−1)!≡−1 mod p 或 (p-1)!≡p-1 mod p;
当p为合数时,(p-1)!≡0 mod n 。
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e6 +10;
const int maxm = 1e6 + 10;
int v[maxn];
vector <int> pri;
int cnt, n;
int ans[maxn];
void prime(){
for (int i =2 ; i < maxn; i++){
if (!v[i]) pri.push_back(i);
for (int j = 0; j < pri.size() && pri[j] * i < maxn; j++){
v[i * pri[j]] = 1;
if (i % pri[j] == 0) break;
}
}
}
int main()
{
prime();
cnt = pri.size();
int T;cin >> T;
for (int i = 1; i < maxm; i++){
int k = 3 * i + 7;
if (!v[k]) ans[i] = ans[i - 1] + 1;
else ans[i] = ans[i -1];
}
while (T--){
scanf("%d", &n);
cout << ans[n] << endl;
}
return 0;
}