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()
  a = ""
  b = ""
  c = ""
  d = ""
  # for i in range(0,int((len(S)-1)/2)):
  #     a+=S[i]
  # for i in range(int((len(S)-1)/2)-1,-1,-1):
  #     b+=S[i]
  # for j in range(int((len(S)+3)/2)-1,len(S)):
  #     c+=S[j]
  # for j in range(len(S)-1,int((len(S)+3)/2)-2,-1):
  #     d+=S[j]
  
  # # print(a)
  # # print(b)
  # # print(c)
  # # print(d)
  # if a == b and c==d:
  #     print('Yes')
  # else:
  #     print('No')
  
  mae = ""
  usiro = ""
  N = len(S)
  mae = S[0 : int((N - 1) / 2)]
  eam = S[-int((N - 1) / 2) :]
  usiro = S[int((N + 3) / 2) - 1 :]
  orisu = S[-int(((N + 3) / 2)) + 2 :]
  # print(mae)
  # print(eam)
  # print(usiro)
  # print(orisu)
  for i in range(len(mae) - 1, -1, -1):
      a += mae[i]
  # print(a)
  for i in range(len(usiro) - 1, -1, -1):
      b += usiro[i]
  # print(b)
  
  if mae == a and usiro == b:
      print("Yes")
  else:
      print("No")
  
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"}]