##### Time limit: 0.5s

##### Memory limit: 16MB

##### Input:

##### Output:

# Task

You are given $t$ and $t$ non-negative integers. Find for each of the integers if they are *palindrome* or not.

An integer is *palindrome* if its writing from left to right is the same as its writing from right to left. For example, the numbers $8$, $5995$, $101$ and $76967$ are *palindromes*, but numbers $59343$, $19120$, $100$ or $3592923$ are not *palindromes*.

# Input data

The first line of the input will contain $t$, the number of integers we will have to check. The next $t$ lines will contain the numbers for which we will have to check if they are *palindromes* or not.

# Output data

The $i^{th}$ line will have `YES`

if the $i^{th}$ value is a *palindrome* or `NO`

otherwise.

# Constraints and clarifications

- $1 \leq t \leq 100 \ 000$;
- The $t$ integers will be less or equal to $9 \ 999 \ 999 \ 999$.
- For tests worth $60$ points, the $t$ integers will be less or equal to $999 \ 999 \ 999$.

# Example

`stdin`

```
5
401
54345
99
102919201
58353
```

`stdout`

```
NO
YES
YES
YES
NO
```

## Explanation

The right to left writings for the given numbers are $104$, $54345$, $99$, $102919201$ and $35383$.