#include <bits/stdc++.h>
using std::cin;
using std::cout;
int main() {
  int t = 0;
  cin >> t;
  while (t--) {
    std::string s;
    cin >> s;
    if (s.size() % 2) {
      cout << "NO\n";
      continue;
    }
    int l1 = s.size() - 1;
    int l2 = s.size() / 2 - 1;
    char ok = 1;
    while (l1 > s.size() / 2 - 1 && l2 > -1) {
      if (s[l1--] != s[l2--]) {
        ok = 0;
        break;
      }
    }
    cout << (ok ? "YES\n" : "NO\n");
  }
  return 0;
}

### Prompt

Your challenge is to write 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 std::cin;
using std::cout;
int main() {
  int t = 0;
  cin >> t;
  while (t--) {
    std::string s;
    cin >> s;
    if (s.size() % 2) {
      cout << "NO\n";
      continue;
    }
    int l1 = s.size() - 1;
    int l2 = s.size() / 2 - 1;
    char ok = 1;
    while (l1 > s.size() / 2 - 1 && l2 > -1) {
      if (s[l1--] != s[l2--]) {
        ok = 0;
        break;
      }
    }
    cout << (ok ? "YES\n" : "NO\n");
  }
  return 0;
}

```