output_description: If S is a strong palindrome, print `Yes`; otherwise, print `No`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      S
attempt: S = input()
  N = len(S)
  s1 = S[0 : (N - 1) // 2]
  s2 = S[(N + 1) // 2 : N]
  t = list(s2)
  t.reverse()
  s3 = "".join(t)
  if s1 != s3:
      print("No")
      exit()
  N = len(s1)
  s4 = s1[0 : (N - 1) // 2]
  s5 = s1[(N + 1) // 2 : N]
  t = list(s5)
  t.reverse()
  s6 = "".join(t)
  if s4 != s6:
      print("No")
      exit()
  N = len(s2)
  s7 = s2[0 : (N - 1) // 2]
  s8 = s2[(N + 1) // 2 : N]
  t = list(s8)
  t.reverse()
  s9 = "".join(t)
  if s7 != s9:
      print("No")
      exit()
  print("Yes")
  
problem_description: Statement
  
  A string S of an odd length is said to be a _strong palindrome_ if and only if
  all of the following conditions are satisfied:
  
    * S is a palindrome.
    * Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome.
    * The string consisting of the (N+3)/2-st through N-th characters of S is a palindrome.
  
  Determine whether S is a strong palindrome.
samples: [{"input": "akasaka", "output": "Yes\n    \n\n  * S is `akasaka`.\n  * The string formed by the 1-st through the 3-rd characters is `aka`.\n  * The string formed by the 5-th through the 7-th characters is `aka`. All of these are palindromes, so S is a strong palindrome.\n\n* * *"}, {"input": "level", "output": "No\n    \n\n* * *"}, {"input": "atcoder", "output": "No"}]