#include <bits/stdc++.h>
using namespace std;
long long int t, n, i = 0, j = 0, k = 0, l = 0;
int main() {
  scanf("%lli", &t);
  while (t--) {
    string s;
    cin >> s;
    long long int l = s.size(), c = 0;
    for (i = 0, j = l / 2; i < l, j < l; i++, j++) {
      if (s[i] != s[j]) c = 1;
    }
    if (c || l % 2)
      printf("NO\n");
    else
      printf("YES\n");
  }
  cerr << "[Execution : " << (1.0 * clock()) / CLOCKS_PER_SEC << "s]" << endl;
  return 0;
}

### Prompt

Please provide a Cpp coded solution to the problem described below:

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.

Input

The first line of input data contains an integer t (1 ≤ t ≤ 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.

Output

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).

Example

Input


10
a
aa
aaa
aaaa
abab
abcabc
abacaba
xxyy
xyyx
xyxy


Output


NO
YES
NO
YES
YES
YES
NO
NO
NO
YES

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
long long int t, n, i = 0, j = 0, k = 0, l = 0;
int main() {
  scanf("%lli", &t);
  while (t--) {
    string s;
    cin >> s;
    long long int l = s.size(), c = 0;
    for (i = 0, j = l / 2; i < l, j < l; i++, j++) {
      if (s[i] != s[j]) c = 1;
    }
    if (c || l % 2)
      printf("NO\n");
    else
      printf("YES\n");
  }
  cerr << "[Execution : " << (1.0 * clock()) / CLOCKS_PER_SEC << "s]" << endl;
  return 0;
}

```