#include #include #include #include using namespace std; vectorprime; int arr[100005]; int mark[100005]; //vector prime; void sieve() { int i,j,limit = sqrt(100000+2); for(i=4; i<=100000; i+=2) mark[i] = 1; mark[1] = 1; prime.push_back(2); for(i=3; i<=100000; i+=2) { if(!mark[i]) { prime.push_back(i); if(i>t; int alc=0,bob=0,i,j,mrk2[100005]; while(t--) { int cnt=0; cin>>n; for(i=0; prime[i]<=n; i++) { //cout<