Square String?

题意翻译

求有没有一种办法，将给定字符串分成连续的两个字符串，两段字符串相同。

题目描述

A string is called square if it is some string written twice in a row. For example, the strings "aa", "abcabc", "abab" and "baabaa" are square. But the strings "aaa", "abaaab" and "abcdabc" are not square. For a given string $ s $ determine if it is square.

输入输出格式

输入格式

The first line of input data contains an integer $ t $ ( $ 1 \le t \le 100 $ ) —the number of test cases. This is followed by $ t $ lines, each containing a description of one test case. The given strings consist only of lowercase Latin letters and have lengths between $ 1 $ and $ 100 $ inclusive.

输出格式

For each test case, output on a separate line: - YES if the string in the corresponding test case is square, - NO otherwise. You can output YES and NO in any case (for example, strings yEs, yes, Yes and YES will be recognized as a positive response).

输入输出样例

输入样例 #1

10
a
aa
aaa
aaaa
abab
abcabc
abacaba
xxyy
xyyx
xyxy

输出样例 #1

NO
YES
NO
YES
YES
YES
NO
NO
NO
YES