Problem Description

Can we divided a given string S into three nonempty palindromes?

Input

First line contains a single integer $T \leq 20$ which denotes the number of test cases.

For each test case , there is an single line contains a string S which only consist of lowercase English letters.$1\leq |s| \leq 20000$

Output

For each case, output the "Yes" or "No" in a single line.

2
abc
abaadada

Yes
No