#include <iostream>
using namespace std;
int P[100], S[100/32];
bool check(int n, int p)
{
return (bool) (n & (1<<p));
}
int set(int n, int p)
{
return n = (n | (1<<p));
}
void bitSieve(int n)
{
int i, j, lim = sqrt(n);
for(i=3; i<=lim; i+=2) {
if(!check(S[i/32], i%32))
for(j=i*i; j<=n; j+=i*2)
S[j/32] = set(S[j/32], j%32);
}
}
int main()
{
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IFBbMTAwXSwgU1sxMDAvMzJdOwoKYm9vbCBjaGVjayhpbnQgbiwgaW50IHApCnsKICByZXR1cm4gKGJvb2wpIChuICYgKDE8PHApKTsKfQoKaW50IHNldChpbnQgbiwgaW50IHApCnsKICByZXR1cm4gbiA9IChuIHwgKDE8PHApKTsKfQoKdm9pZCBiaXRTaWV2ZShpbnQgbikKewogIGludCBpLCBqLCBsaW0gPSBzcXJ0KG4pOwoKICBmb3IoaT0zOyBpPD1saW07IGkrPTIpIHsKICAgIGlmKCFjaGVjayhTW2kvMzJdLCBpJTMyKSkKICAgICAgZm9yKGo9aSppOyBqPD1uOyBqKz1pKjIpCiAgICAgICAgU1tqLzMyXSA9IHNldChTW2ovMzJdLCBqJTMyKTsKICB9Cn0KCmludCBtYWluKCkKewoKICByZXR1cm4gMDsKfQ==