#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e3 + 5;
const double eps = 1e-8;
#define el "\n"
string s;
int add()
{
int sum = 0;
for (int i = 0; i < s.size(); ++i) {
if(s[i] >= 'a' && s[i] <= 'z')
sum += s[i] - 96;
else
sum += s[i] - 38;
}
return sum;
}
bool isPrime[N+2];
void sieve(int limit){
for(int i = 2; i <= limit; i++)
isPrime[i] = 1;
for(ll i = 2; i * i <= limit; i++)
if(isPrime[i])
for(ll j = i * i; j <= limit; j += i)
isPrime[j] = 0;
}
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
sieve(N);
while(getline(cin ,s))
{
int sum = add();
if(isPrime[sum])
cout << "It is a prime word." << el;
else
cout <<"It is not a prime word." << el;
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnR5cGVkZWYgbG9uZyBsb25nIGxsOwpjb25zdCBpbnQgTiA9IDFlMyArIDU7CmNvbnN0IGRvdWJsZSBlcHMgPSAxZS04OwojZGVmaW5lIGVsICJcbiIKCgpzdHJpbmcgczsKCmludCBhZGQoKQp7CiAgICBpbnQgc3VtID0gMDsKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgcy5zaXplKCk7ICsraSkgewogICAgICAgIGlmKHNbaV0gPj0gJ2EnICYmIHNbaV0gPD0gJ3onKQogICAgICAgICAgICBzdW0gKz0gc1tpXSAtIDk2OwogICAgICAgIGVsc2UKICAgICAgICAgICAgc3VtICs9IHNbaV0gLSAzODsKICAgIH0KICAgIHJldHVybiBzdW07Cn0KYm9vbCBpc1ByaW1lW04rMl07Cgp2b2lkIHNpZXZlKGludCBsaW1pdCl7CiAgICBmb3IoaW50IGkgPSAyOyBpIDw9IGxpbWl0OyBpKyspCiAgICAgICAgaXNQcmltZVtpXSA9IDE7CgogICAgZm9yKGxsIGkgPSAyOyBpICogaSA8PSBsaW1pdDsgaSsrKQogICAgICAgIGlmKGlzUHJpbWVbaV0pCiAgICAgICAgICAgIGZvcihsbCBqID0gaSAqIGk7IGogPD0gbGltaXQ7IGogKz0gaSkKICAgICAgICAgICAgICAgIGlzUHJpbWVbal0gPSAwOwp9CgppbnQgbWFpbigpIHsKICAgIGlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oMCk7Y2luLnRpZSgwKTtjb3V0LnRpZSgwKTsKCiAgICBzaWV2ZShOKTsKICAgIHdoaWxlKGdldGxpbmUoY2luICxzKSkKICAgIHsKICAgICAgICBpbnQgc3VtID0gYWRkKCk7CiAgICAgICAgaWYoaXNQcmltZVtzdW1dKQogICAgICAgICAgICBjb3V0IDw8ICJJdCBpcyBhIHByaW1lIHdvcmQuIiA8PCBlbDsKICAgICAgICBlbHNlCiAgICAgICAgICAgIGNvdXQgPDwiSXQgaXMgbm90IGEgcHJpbWUgd29yZC4iIDw8IGVsOwogICAgfQoKCgoKCgogICAgcmV0dXJuIDA7Cn0K