Kevin has a string S consisting of N lowercase English letters.
Kevin wants to split it into 4 pairwise different non-empty parts. For example, string “happynewyear” can be splitted into “happy”, “new”, “ye” and “ar”. He can’t delete any characters or change the order of the characters.
Help Kevin and find if there exist at least one possible spliting.
The first line of input will contain an integer T, denoting the number of test cases. Each of the next T lines contains a string S.
For every test case output “YES” if it is possible to split the string and “NO” otherwise.
1 ≤ T ≤ 100
1 ≤ N ≤ 1000
N ≤ 20 in test data worth 40% of all points
Sample Input(Plaintext Link)
Sample Output(Plaintext Link)