B. Breaking Up Words
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

GG is a new coach in town ready to present several seminars during the week. Wanting to be very exclusive, he only allows people to enter whose name is a palindrome. Recall that a palindrome is a word that is read the same backwards. As you can imagine, this really narrows down how many people are able to enter.

As such, on Wednesday afternoons, he changes the entry requirements in order to gift the unwashed masses with his outstanding knowledge. The requirement becomes the following: you're able to enter only if you're able to find an existing palindrome of length greater than or equal to $$$2$$$ within your name.

For each person that will try to attend the seminar this Wednesday afternoon, help GG determine whether or not access will be granted.

Input

The first line contains a single integer $$$n$$$ $$$(1 \leq n \leq 3 \times 10^5)$$$ — the amount of people that will try to attend the seminar.

The next $$$n$$$ lines contain a single string $$$s$$$ $$$(1 \leq |s| \leq 20)$$$ — their names. The names consist only of lowercase letters of the English alphabet.

Output

For each person, print out yes if access is granted, no otherwise.

Example
Input
3
hannah
vieira
limevaz
Output
yes
yes
no
Note

Hannah is already a palindrome, so access is granted! Within Vieira, you have iei, which is indeed a palindrome!