description: 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
solution: """
   ___   _   _    ___  __   ___ _  _     __   ____ ___ _  _   _
  |__   /_\  |\ |  |  |  | |__  |__|     |_|  |__   |  |__|  /_\
  ___| /   \ | \|  |  |__| ___| |  |     |__| |___  |  |  | /   \
  
  """
  for _ in range(int(input())):
      s = input()
      n = len(s)
      flag = 0
      for i in range(n):
          for j in range(i+1, n):
              x = s[i:j+1]
              y = s[j+1:j+1+j-i+1]
              if(x == y and n == len(x)+len(y)):
                  flag = 1
                  break
          if(flag):
              break
      if(flag or (n == 2 and s[0] == s[1])):
          print("YES")
      else:
          print("NO")
  