UVA_10945_Mother_Bear

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <sstream>
#include <stdlib.h>
#include <cmath>
#define FOR(i,A) for(typeof (A).begin() i = (A).begin() ; i != (A).end() ; i++)
#define mp make_pair
#define debug( x ) cout << #x << " = " << x << endl
#define clr(v,x) memset( v, x , sizeof v )
#define all(x) (x).begin() , (x).end()
#define rall(x) (x).rbegin() , (x).rend()
#define TAM 110

using namespace std;

typedef pair<int,int> ii ;
typedef long long ll ;
typedef long double ld ;
typedef pair<int,ii> pii ;

char cad[1000];

bool ispali(string s){
string str=s;
reverse(str.begin(),str.end());
 if(str==s) return true;
 else return false;
}
int main() {
    while(gets(cad)){
        if(strcmp(cad,"DONE")==0) break;
        int n=strlen(cad);string s="";
        for(int i=0;i<n;i++){
            if(cad[i]!='!' && cad[i]!='.' && cad[i]!=',' && cad[i]!='?'){
                if(isalpha(cad[i])){
                    s+=(tolower(cad[i]));
                }

            }else continue;
        }
        bool pali= ispali(s);
        cad[n]='\0';
        if (pali) printf("You won't be eaten!\n");
        else printf("Uh oh..\n");
    }
    return 0;
}