Problem1016--Two adjacent substrings

1016: Two adjacent substrings

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 128 MiB

Description

Given a string with English letters (all in upper case), please check if there are two adjacent substrings are equal or not!


Input

The first line contains an integer K which is the number of test cases.
The following K lines, each line has one string whose length is N  (1 <= N <= 10,000 )

Output

For each case, output TRUE or FALSE, in total, K lines

Sample Input Copy

3
ABEFBEFC
ABEFBEK
ABCDDKFLE

Sample Output Copy

TRUE
FALSE
TRUE

Source/Category