Palindromic Number Checker

You are given a list of numbers. For each number, determine whether it is a palindrome. A number is said to be a palindrome if it remains the same when its digits are reversed. For example, 121 is a palindrome, while 123 is not.

The task is to read an integer T from standard input, which indicates the number of test cases. Each of the following T lines contains one integer. For each test case, output "Palindrome" if the number is a palindrome, otherwise output "Not a Palindrome".

Recall that a palindrome satisfies the condition: \[ \text{number} = \text{reverse}(\text{number}) \]

inputFormat

The first line contains a single integer T representing the number of test cases. Each of the next T lines contains a single integer.

Input Format:

T
N1
N2
... 
NT

outputFormat

For each test case, output one line containing either "Palindrome" if the number is a palindrome or "Not a Palindrome" otherwise.

## sample

1
121

Palindrome

</p>