import java.util.Scanner;

public class Palindromer
{
    @SuppressWarnings("resource")
    public static void main(String[] args)
    {
	Scanner input = new Scanner(System.in);
	while (true)
	{
	    System.out.println("Enter string to check for Palindrome");
	    String pal = input.nextLine();
	    pal = pal.toLowerCase().replace(" ", "");
	    boolean odd = pal.length()%2 == 1;
	    // really want char in stack, but it is primitive type
	    // so use Character  similar to int/Integer
	    AStack<Character> aSStr = new AStack<>(); 
	    for (int i=0; i<pal.length() / 2; i++)
	    {
		aSStr.push(pal.charAt(i)); // note autoboxing
	    }
	    int st = pal.length()/2;
	    if (odd)
	    {
		st++;
	    }
	    boolean good = true;
	    for (int i=st; i<pal.length(); i++)
	    {
		Character fromStack = aSStr.pop();
		char fromString = pal.charAt(i);
		if (fromStack==null || fromStack!=fromString)  // note autounboxing
		{
		    good = false;
		    break;
		}
	    }
	    if (good)
		System.out.println("PALIDROME!!");
	    else
		System.out.println("NOT");
	}
		
    }
}