#include<cstdio>
#include<algorithm>
using namespace std;
void BubbleSort(int *arr,int n)
{
for(int i=0;i<n;i++)
{
for(int j=i+1; j<n;j++)
{
if(arr[j] < arr[i])
{
int tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
}
}
}
return;
}
int CheckPrime(int n)
{
if(n==1)
return 0;
for(int i=2;i*i<=n;i++)
{
if(n%i == 0)
return 0;
}
return 1;
}
int main()
{
int n =1000000007;
if(CheckPrime(n) == 1)
printf("prime");
else
printf("Not Prime");
return 0;
}
I2luY2x1ZGU8Y3N0ZGlvPgojaW5jbHVkZTxhbGdvcml0aG0+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKdm9pZCBCdWJibGVTb3J0KGludCAqYXJyLGludCBuKQp7CiAgICBmb3IoaW50IGk9MDtpPG47aSsrKQogICAgewogICAgICAgIGZvcihpbnQgaj1pKzE7IGo8bjtqKyspCiAgICAgICAgewogICAgICAgICAgICBpZihhcnJbal0gPCBhcnJbaV0pCiAgICAgICAgICAgIHsKICAgICAgICAgICAgICAgIGludCB0bXAgPSBhcnJbaV07CiAgICAgICAgICAgICAgICBhcnJbaV0gPSBhcnJbal07CiAgICAgICAgICAgICAgICBhcnJbal0gPSB0bXA7CiAgICAgICAgICAgIH0KICAgICAgICB9CiAgICB9CiAgICByZXR1cm47Cn0KCmludCBDaGVja1ByaW1lKGludCBuKQp7CiAgICBpZihuPT0xKQogICAgICAgIHJldHVybiAwOwogICAgZm9yKGludCBpPTI7aSppPD1uO2krKykKICAgIHsKICAgICAgICBpZihuJWkgPT0gMCkKICAgICAgICAgICAgcmV0dXJuIDA7CiAgICB9CiAgICByZXR1cm4gMTsKfQoKaW50IG1haW4oKQp7CiAgICBpbnQgbiA9MTAwMDAwMDAwNzsKICAgIGlmKENoZWNrUHJpbWUobikgPT0gMSkKICAgICAgICBwcmludGYoInByaW1lIik7CiAgICBlbHNlCiAgICAgICAgcHJpbnRmKCJOb3QgUHJpbWUiKTsKICAgIHJldHVybiAwOwp9Cg==