UVa 10924

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

typedef long long int       ll;
typedef unsigned long long int  ull;
typedef vector<int>         vi;
typedef vector<ll>          vll;
typedef vector<vi>          vvi;
typedef pair<int,int >      pii;
typedef vector< pii >       vpii;
typedef set<int>            sti;

#define sc                  scanf
#define pf                  printf
#define sci(n)              scanf("%d",&n)
#define scl(n)              scanf("%lld",&n)
#define scf(n)              scanf("%lf",&n)
#define pfi(n)              printf("%d",n)
#define pfl(n)              printf("%lld",n)
#define pff(n)              cout<<n
#define line                printf("\n")
#define spc                 printf(" ")
#define loop(i,x,y)         for(int i=int(x); i<=int(y); i++)
#define rloop(i,y,x)        for(int i=int(y); i>=int(x); i--)
#define cspf(i)             printf("Case %d: ", i)
#define pb                  push_back
#define mp                  make_pair
#define ff                  first
#define ss                  second
#define all(v)              v.begin(),v.end()
#define rall(v)             v.rbegin(),v.rend()
#define read()              freopen("input.txt", "r", stdin)
#define write()             freopen("output.txt", "w", stdout)
/// Constants
#define eps                 1e-9
#define PI                  acos(-1.0)  // 3.1415926535897932

vi chk(2000);

void seive(){
    chk[0]=1;
    chk[1]=0;
    for(int i=2;i<=1500;i++){
        if(chk[i]==1)
            continue;
        for(int j=2;i*j<=1500;j++){
            chk[i*j]=1;
        }
    }
}


int main()
{
    seive();
    read();
    write();
    char a[30];
    int j=0;
    while(scanf("%s",a)!=EOF){
        j++;
        int ln=strlen(a);
        int x,sm=0;
        loop(i,0,ln-1){
            if(a[i]>='A' && a[i]<='Z')
                x=a[i]-38;
            else if(a[i]>='a' && a[i]<='z')
                x=a[i]-96;
            sm+=x;
        }
        //cspf(j);
        if(chk[sm]==1)
            pf("It is not a prime word.\n");
        else
            pf("It is a prime word.\n");
    }
    return 0;
}