UVA 10924

/***
Md. Namzul Hasan
Shahjalal University of Science & Technology,Sylhet.
hasan08sust@gmail.com
***/
#include<iostream>
#include<cstdio>
#include<stack>
#include<queue>
#include<map>
#include<vector>
#include<algorithm>
#include<cstring>
#include<sstream>
#include<cmath>
#include <iomanip>
using namespace std ;
typedef long long ll ;
typedef int in ;
typedef unsigned long long ull ;
const double pi = 2*acos(0) ;
#define maxi 40000
#define pf printf
#define sc scanf
#define pb push_back
#define MEM(x,y) (memset((x),(y),sizeof(x)))
#define MIN(x,y) ((x) < (y) ? (x) : (y))
#define MAX(x,y) ((x) > (y) ? (x) : (y))
#define load(array,size)  for(int i=0 ; i<size ; i++) cin>>array[i]  ;
#define new_line  pf("\n")
#define clear_data(array) memset(array,0,sizeof(array))
#define highest_int 2147483647

int isPrime(int n){

  if(n <= 2){
    return 1 ;
  }

  if(n%2 == 0){
    return 0;
  }

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

   return 1;


}

int main()
{
   char str[101];
   int m,sum;

   while(gets(str)){
        sum =0;

      for(int i=0 ; i<strlen(str);i++){

        if(str[i] >=65 && str[i]<= 90){
            m = (str[i]- 'A') +27;
            sum += m;
        }else if(str[i] >= 97 && str[i] <=122){
           m = (str[i] - 'a') +1;
           sum += m;
        }
      }

      if(isPrime(sum)){
        pf("It is a prime word.\n");
      }else{
        pf("It is not a prime word.\n");
      }
   }

    return 0;
}