/*********** [ scopeInfinity ] ******************/ #include using namespace std; typedef long long ll; typedef std::vector vll; #define endl '\n' #define mp make_pair #define pb(x) push_back((x)) ll MOD = 1e9+7; ll INF = LLONG_MAX; vector &split(const std::string &s, char delim, vector &e) { stringstream ss(s); string item; while(getline(ss, item, delim)) e.push_back(item); return e; } ll Pow(ll a ,int b ,int Mo){ ll ans = 1; for (; b; b >>= 1, a = a * a % Mo) if (b&1) ans = ans * a % Mo; return ans; } ll MAX=1e5+1; std::vector DP(MAX,0); long solve() { ll N; cin>>N; ll x = DP[N]; return !(x%2); } int main(int argc, char const *argv[]) { std::ios::sync_with_stdio(false); // cout< prime(MAX,true); for (int i = 2; i < MAX; ++i) if(prime[i]){ for (int j = 2; j*i < MAX; ++j) prime[i*j]=false; } for (int i = 2; i < MAX; ++i) { DP[i]=DP[i-1]; if(prime[i]) DP[i]++; // cerr<>T; for (int i = 0; i < T; ++i) { // cout<<"Case #"<