#include <stdio.h>
int main()
{
int number,i,j;
int primes[number+1];
//populating array with naturals numbers
for(i = 2; i<=number; i++)
primes[i] = i;
i = 2;
while ((i*i) <= number)
{
if (primes[i] != 0)
{
for(j=2; j<number; j++)
{
if (primes[i]*j > number)
break;
else
// Instead of deleteing , making elemnets 0
primes[primes[i]*j]=0;
}
}
i++;
}
for(i = 2; i<=number; i++)
{
//If number is not 0 then it is prime
if (primes[i]!=0)
}
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CgppbnQgbWFpbigpCnsKICAgIGludCBudW1iZXIsaSxqOwogICAgcHJpbnRmKCJFbnRlciB0aGUgbnVtYmVyXG4iKTsKICAgIHNjYW5mKCIlZCIsJm51bWJlcik7CgogICAgaW50IHByaW1lc1tudW1iZXIrMV07CgogICAgLy9wb3B1bGF0aW5nIGFycmF5IHdpdGggbmF0dXJhbHMgbnVtYmVycwogICAgZm9yKGkgPSAyOyBpPD1udW1iZXI7IGkrKykKICAgICAgICBwcmltZXNbaV0gPSBpOwoKICAgIGkgPSAyOwogICAgd2hpbGUgKChpKmkpIDw9IG51bWJlcikKICAgIHsKICAgICAgICBpZiAocHJpbWVzW2ldICE9IDApCiAgICAgICAgewogICAgICAgICAgICBmb3Ioaj0yOyBqPG51bWJlcjsgaisrKQogICAgICAgICAgICB7CiAgICAgICAgICAgICAgICBpZiAocHJpbWVzW2ldKmogPiBudW1iZXIpCiAgICAgICAgICAgICAgICAgICAgYnJlYWs7CiAgICAgICAgICAgICAgICBlbHNlCiAgICAgICAgICAgICAgICAgICAgLy8gSW5zdGVhZCBvZiBkZWxldGVpbmcgLCBtYWtpbmcgZWxlbW5ldHMgMAogICAgICAgICAgICAgICAgICAgIHByaW1lc1twcmltZXNbaV0qal09MDsKICAgICAgICAgICAgfQogICAgICAgIH0KICAgICAgICBpKys7CiAgICB9CgogICAgZm9yKGkgPSAyOyBpPD1udW1iZXI7IGkrKykKICAgIHsKICAgICAgICAvL0lmIG51bWJlciBpcyBub3QgMCB0aGVuIGl0IGlzIHByaW1lCiAgICAgICAgaWYgKHByaW1lc1tpXSE9MCkKICAgICAgICAgICAgcHJpbnRmKCIlZFxuIixwcmltZXNbaV0pOwogICAgfQoKICAgIHJldHVybiAwOwp9