#include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
int main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long int t;
  cin >> t;
  while (t--) {
    string s;
    cin >> s;
    long long int size = s.length();
    long long int count(0);
    if (size % 2 != 0) {
      cout << "NO" << endl;
    } else {
      string s2;
      for (int i = (size / 2); i < size; ++i) {
        s2.push_back(s[i]);
      }
      for (int i = 0; i <= (size / 2); ++i) {
        if (s[i] == s2[i]) ++count;
      }
      if (count == (size / 2))
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
}

### Prompt

Develop a solution in cpp 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 mod = 1e9 + 7;
int main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long int t;
  cin >> t;
  while (t--) {
    string s;
    cin >> s;
    long long int size = s.length();
    long long int count(0);
    if (size % 2 != 0) {
      cout << "NO" << endl;
    } else {
      string s2;
      for (int i = (size / 2); i < size; ++i) {
        s2.push_back(s[i]);
      }
      for (int i = 0; i <= (size / 2); ++i) {
        if (s[i] == s2[i]) ++count;
      }
      if (count == (size / 2))
        cout << "YES" << endl;
      else
        cout << "NO" << endl;
    }
  }
}

```