#include <bits/stdc++.h>
using namespace std;

bool is_prime = true;

bool isPrime(int n){
    if (n <= 1){
    	return false;
    }
        for (int i = 2; i * i <= n; i++){
            if (n % i == 0){
                return false;
        } 
    }
    return true;
}

int reversed(int n){
    int terbalik = 0;
    
    while (n > 0){
        int sisa = n % 10;
        terbalik = terbalik * 10 + sisa;
        n = n / 10;
    }
    return terbalik;
}

int main (){
    int n;
    while (cin >> n) {
        if (!isPrime(n)) {
            cout << n << " is not prime." << endl;
        } else {
            int rev = reversed(n); 
            
            if (rev != n && isPrime(rev)) {
                cout << n << " is emirp." << endl;
            } else {
                cout << n << " is prime." << endl;
            }
        } 
    }
}