#include<bits/stdc++.h>
using namespace std;
#define MX 100000000
bool prime[MX+2];
int cnt=-1;
void sieve()
{
prime[1] = 1;
for(int i = 2;i*i<=MX;i++)
{
if(prime[i] == 0)
{
for(int j = i*i;j<=MX;j+=i)
{
prime[j] = 1;
}
}
}
}
int main()
{
sieve();
for(int i=2;i<=10000;i++)
{
if(prime[i]==0)
{
cnt++;
if(cnt%100==0)
{
printf("%d\n",i);
}
}
}
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKI2RlZmluZSBNWCAxMDAwMDAwMDAKYm9vbCBwcmltZVtNWCsyXTsKaW50IGNudD0tMTsKCnZvaWQgc2lldmUoKQp7CiAgICBwcmltZVsxXSA9IDE7CiAgICBmb3IoaW50IGkgPSAyO2kqaTw9TVg7aSsrKQogICAgewogICAgICAgIGlmKHByaW1lW2ldID09IDApCiAgICAgICAgewogICAgICAgICAgICBmb3IoaW50IGogPSBpKmk7ajw9TVg7ais9aSkKICAgICAgICAgICAgewogICAgICAgICAgICAgICAgcHJpbWVbal0gPSAxOwogICAgICAgICAgICB9CiAgICAgICAgfQogICAgfQp9CmludCBtYWluKCkKewogICAgc2lldmUoKTsKICAgIGZvcihpbnQgaT0yO2k8PTEwMDAwO2krKykKICAgIHsKICAgICAgICBpZihwcmltZVtpXT09MCkKICAgICAgICB7CiAgICAgICAgICAgIGNudCsrOwogICAgICAgICAgICBpZihjbnQlMTAwPT0wKQogICAgICAgICAgICB7CiAgICAgICAgICAgICAgICBwcmludGYoIiVkXG4iLGkpOwogICAgICAgICAgICB9CgogICAgICAgIH0KICAgIH0KCiAgICByZXR1cm4gMDsKfQ==