Contest1472/F.cpp

#include<bits/stdc++.h>
using namespace std;
int Primer(int n) {
    if(n < 2)return 0;
    if(n == 2)return 1;
    if(n % 2 == 0)return 0;
    for(int i = 3; i * i <= n; i += 2) {
        if(n % i == 0)return 0;
    }
    return 1;
}
int main(){
    int n;cin>>n;
    if(Primer(n)){
        cout<<"Prime!";
    }else{
        cout<<"Not Prime!";
    }
     
    return 0;
}