Svetozar got off the metro in a neighborhood of the city completely unlike his own. Colorful signs with lots of letters, placed everywhere, were a delight to the eye.
The walk was long. Out of boredom, Svetozar started looking at the signs and searching them for palindromic substrings of length $$$3$$$. You should also say whether such a palindrome appears on the sign.
Recall that a substring is a contiguous fragment of a string. A string is a palindrome if it reads the same left to right and right to left, and its length is the number of characters in it. For example, the strings aba and aaa are palindromes of length $$$3$$$, the string abb is not a palindrome, and the string abba is a palindrome, but not of length $$$3$$$.
The first line contains an integer $$$t$$$ ($$$1 \leq t \leq 2 \cdot 10^5$$$): the number of test cases. Then, $$$t$$$ test cases follow.
The only line of a test case contains a string $$$s$$$ ($$$1 \leq |s| \leq 2 \cdot 10^5$$$) of lowercase English letters: the contents of the sign.
It is guaranteed that the sum of the lengths of the strings $$$s$$$ over all test cases does not exceed $$$2 \cdot 10^5$$$.
For each test case, print YES if the string $$$s$$$ contains a palindromic substring of length $$$3$$$, and NO otherwise. You may print the words in any case.
7abaabcaaaabbaaaaabcbdd
YESNONONONOYESYES
In the fifth test case of the sample, the string abba itself is a palindrome, but its substrings of length $$$3$$$ – abb and bba – are not palindromes.