Palindromic Number Checker

This problem requires you to determine whether a given number is a palindromic number. A number is considered palindromic if it remains the same when its digits are reversed. In other words, a number \( n \) is palindromic if and only if \( n = \text{reverse}(n) \).

You are given an integer \( T \) representing the number of test cases, followed by \( T \) integers. For each integer, output YES if it is palindromic and NO otherwise.

Example: For input

3
121
12321
123

the output should be:

YES
YES
NO

inputFormat

The first line contains a positive integer \( T \), the number of test cases. Each of the next \( T \) lines contains a single integer \( n \) (\(0 \leq n \leq 10^9\)).

outputFormat

For each test case, print YES in a new line if the given number is a palindromic number, otherwise print NO.

## sample

3
121
12321
123

YES
YES
NO

</p>