Warning: Only Brainf**k language is allowed.

After I solve this problem in 0.00s using BF , I have an idea to set new BF problems, now here I come

The task is simple, given a (1="length of string"=1000) just check if the string is palindrome or not.

The string contains character in range ASCII(32)=char=ASCII(126)

Input

The first line, there is an integer T (1 ≤ T ≤ 1000) denoting number of test cases then you should process only next T lines, each line is a terminated by new line character ('\n') ASCII(10)

Output

For each test case:

if <string> is palindrome, output: "<string>" is palindrome

else, output: "<string>" is not palindrome

remember to put '\n' after each test case

Example

Input:
11
abba
abba 
 abba
 abba 
Tjandra Satria Gunawan
Tjandra Satria Gunawan nawanuG airtaS ardnajT
()
((
kasur ini rusak
Kasur ini rusak
x
Don't process this case because T is 11
And also this problem use exact judge so be careful put space and '\n'
Only brainf**k is allowed
and soure limit is 1500 bytes
Output:
"abba" is palindrome
"abba " is not palindrome
" abba" is not palindrome
" abba " is palindrome
"Tjandra Satria Gunawan" is not palindrome
"Tjandra Satria Gunawan nawanuG airtaS ardnajT" is palindrome
"()" is not palindrome
"((" is palindrome
"kasur ini rusak" is palindrome
"Kasur ini rusak" is not palindrome
"x" is palindrome

Time limit ~2x My fastest BF code

If you TLE here, you may try this problem first.

See also: Another problem added by Tjandra Satria Gunawan