A. Kozak Vus and Clever Palindromes

Kozak Vus recently devised an intriguing problem.

You are given $t$ strings, each of which is a palindrome with an odd length. For each string, your task is to determine if there exists a palindrome of even length within it.

A palindrome is a sequence that reads the same forwards and backwards. For instance, "level" and "noon" are palindromes, whereas "abc" and "noun" are not.

A substring $x$ of a string $y$ is formed by removing zero or more characters from the start and zero or more characters from the end of $y$.

Kozak Vus was particularly fond of this problem and the solution he devised. Can you solve it too?

Input

The first line contains an integer $t$ ($1\le t\le 20$) — the number of strings.

The next $t$ lines each contain a string $s_1,s_2,\dots ,s_t$ ($1\le |s_i|\le 10^5$), composed of lowercase Latin letters.

It is guaranteed that each $s_i$ is a palindrome of odd length.

Output

Print $t$ lines. On the $i$-th line, print "Yes" if there is a substring of string $s_i$ that is a palindrome of even length; otherwise, print "No".

Examples

Note

In the second string, the substring "abba" is a palindrome of even length.

In the fourth string, the substring "zyyz" is a palindrome of even length.

Scoring

If your solution correctly handles the case where $t=20$ and $|s_i|=11$, you will earn at least 30 points.