10235

#include <stdio.h>
#include <math.h>

int isPrime(int n) {
    if (n==1) return 0;
    int i;
    int j = sqrt(n);
    for (i=2;i<=j;i++) {
        if (n%i == 0) return 0;
    }
    return 1;
}

int rever(int n) {

    int len = floor(log10(n)) +1 ;
    int na[len];
    int x;

    for (x=0;x<len;x++) {
        na[x] = n%10;
        n=n/10;
    }

    int number=0;

    if (len%2==0) {
        for (x=0;x<len;x++) {
            number = number + na[x] * pow(10,(len-x-1));
        }
    }
    else {
        for (x=0;x<len;x++) {
            number = number + na[x] * pow(10,(len-x));
        }
        number = number/10;
    }

    return number;
}


int main() {
    int a;
    while (scanf("%d",&a) == 1) {

        if (isPrime(a)) {
            int b = rever(a);

            if (isPrime(b)) {
                printf("%d is emirp.\n", a);
            }
            else printf("%d is prime.\n",a);
        }

        else printf("%d is not prime.\n",a);


    }

    return 0;
}