Palindrome Number Checker

In this problem, you are given several integers and you need to determine whether each one is a palindrome. An integer is said to be a palindrome if its sequence of digits reads the same backward as forward. More formally, a non-negative integer (n) with decimal representation (d_1d_2\dots d_k) is a palindrome if (d_i = d_{k+1-i}) for every (i = 1, 2, \dots, k). Negative numbers are not considered palindromes.

Your program should read the input from standard input (stdin) and print the result for each test case to standard output (stdout).

inputFormat

The first line of input contains a single integer (T) denoting the number of test cases. Each of the following (T) lines contains one integer.

outputFormat

For each test case, print a single line containing the string "YES" if the given integer is a palindrome, or "NO" if it is not.## sample

4
121
-121
10
-101

YES
NO
NO
NO