Problem: 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.

Input format:

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.

Output format:

For every test case output "YES" if it is possible to split the string and "NO" otherwise.

Constraints:
1 ≤ T ≤ 100
1 ≤ N ≤ 1000
N ≤ 20 in test data worth 40% of all points

SAMPLE INPUT
2
ababca
aaabb

SAMPLE OUTPUT
YES
NO

Solution (in PYTHON):

Solution:
tc = int(raw_input())
def goRec(st, parts):
	if len(parts)==4:
		return True
	if len(st)==0:
		return False
	for toIndx in range(len(st)-1, -1, -1):
		if st[:toIndx+1] in parts:
			continue
		parts.append(st[:toIndx+1])
		if goRec(st[toIndx+1:], parts):
			return True
		parts.pop()
	return False
while tc:
	tc -= 1
	st = raw_input()
	if len(st) < 4:
		print "NO"
		continue
	parts = []
	print "YES" if goRec(st, parts) else "NO"