#include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 1;
bool comparator(int a, int b) { return a > b; }
void solve() {
  string s;
  cin >> s;
  int n = s.size();
  if (n % 2 != 0) {
    cout << "NO" << endl;
  } else {
    int low = 0;
    int high = n / 2;
    bool flag = true;
    while (high < n) {
      if (s[low] == s[high]) {
        low++;
        high++;
        continue;
      } else {
        flag = false;
      }
      low++;
      high++;
    }
    if (flag) {
      cout << "YES" << endl;
    } else {
      cout << "NO" << endl;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}

### Prompt

Generate a Cpp solution to the following problem:

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 + 1;
bool comparator(int a, int b) { return a > b; }
void solve() {
  string s;
  cin >> s;
  int n = s.size();
  if (n % 2 != 0) {
    cout << "NO" << endl;
  } else {
    int low = 0;
    int high = n / 2;
    bool flag = true;
    while (high < n) {
      if (s[low] == s[high]) {
        low++;
        high++;
        continue;
      } else {
        flag = false;
      }
      low++;
      high++;
    }
    if (flag) {
      cout << "YES" << endl;
    } else {
      cout << "NO" << endl;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}

```