Problem:
 Score : 200 points    Problem 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.      Constraints  S consists of lowercase English letters.  The length of S is an odd number between 3 and 99 (inclusive).         Input Input is given from Standard Input in the following format:  S       Output If S is a strong palindrome, print Yes ;
otherwise, print No .        Sample Input 1 akasaka      Sample Output 1 Yes   S is akasaka .  The string formed by the 1 -st through the 3 -rd characters is aka .  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.        Sample Input 2 level      Sample Output 2 No       Sample Input 3 atcoder      Sample Output 3 No

Solution (Python):
S = input()

def kaibun(x):
    N = len(x)
    flag = True
    for i in range(N // 2):
        if x[i] != x[-i - 1]:
            flag = False
    return flag

tmp1 = kaibun(S)
tmp2 = kaibun(S[:(len(S) - 1) // 2])
tmp3 = kaibun(S[(len(S) + 3) // 2 - 1:])


if tmp1 and tmp2 and tmp3:
    print('Yes')
else:
    print('No')

Solution (Python):
s=input()
n=len(s)
n1=(n-1)//2
n2=(n+3)//2
s1=s[:n1]
s2=s[n2-1:]

for i in range(1,n1+1):
    if s[i-1]!=s[-i]:
        print('No')
        exit()
for i in range(1,n1//2+1):
    if s1[i-1]!=s1[-i]:
        print('No')
        exit()
print('Yes')

Solution (Python):
s = input()
n = len(s)
front = (n-1) // 2
rear = (n+2) // 2
sf = s[:front]
sr = s[rear:]
srev = s[::-1]
sfrev = sf[::-1]
srrev = sr[::-1]
if sfrev == sf and srrev == sr and srev == s:
    print('Yes')
else:
    print('No')

Solution (Python):
S = input()
if S != S[::-1]:
    print("No")
    exit()

if S[:len(S)//2] != S[:len(S)//2][::-1]:
    print("No")
    exit()
print("Yes")

Solution (Python):
s = input()

n = len(s)
a, b = s[:(n - 1) // 2], s[(n + 1) // 2:]

print("Yes" if s == s[::-1] and a == a[::-1] and b == b[::-1] else "No")

Solution (Python):
S=input()
N=len(S)
A=S[:(N-1)//2]
B=S[(N+3)//2-1:]
if S!=S[::-1] or A!=A[::-1] or B!=B[::-1]:
    print("No")
else:
    print("Yes")

Solution (Python):
s=input()
count=0
n=int(len(s))
t1=s[:int((n-1)/2)]
t2=s[int((n+3)/2-1):]
result='No'
if s==s[::-1]:
    if t1==t1[::-1]:
        if t2==t2[::-1]:
            result='Yes'
print(result)

Solution (Python):
S = input()
N = len(S)

if S == S[::-1] and S[:(N-1)//2] == S[:(N-1)//2][::-1] and S[(N+3)//2-1:] == S[(N+3)//2-1:][::-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()
N = len(S)

if S == S[::-1] and S[:(N-1)//2] == S[:(N-1)//2][::-1] and S[(N+3)//2-1:] == S[(N+3)//2-1:][::-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
s=input()
n=len(s)
x=n//2
a=s[0:x]
b=s[x+1:]
if a==b:print('Yes')
else:print('No')

Solution (Python):

s = input()
n = len(s)
t = s[:(n - 1) // 2]
u = s[(n + 1) // 2:]
print("YNeos"[any([s != s[::-1], t != t[::-1], u != u[::-1]])::2])

Solution (Python):
s=input()
n=len(s)
x=n//2
a=s[0:x]
b=s[x+1:]
if a==b:print('Yes')
else:print('No')

Solution (Python):
s = list(input())
b = s[:(len(s) - 1) // 2]
e = s[:(len(s) - 1) // 2:-1]
e_b = s[(len(s) + 3) // 2 - 1:]
e_e = s[:(len(s) + 3) // 2 - 2:-1]
print("Yes") if b == e and e_b == e_e else print("No")

Solution (Python):
S = input()

ans = "No"
if S == S[::-1]:
    if S[:(len(S) - 1) // 2] == S[:(len(S) - 1) // 2][::-1]:
        if S[(len(S) + 3) // 2 - 1:] == S[(len(S) + 3) // 2 - 1:][::-1]:
            ans = "Yes"
print(ans)

Solution (Python):
s = list(input())

if s == s[::-1]:
    n = len(s)
    kai_1 = s[:(n-1)//2]
    kai_2 = s[(n + 3) // 2 - 1:]
    if (kai_1 == kai_1[::-1]) and (kai_2 == kai_2[::-1]):
        print("Yes")
        exit(0)

print("No")

Solution (Python):
N = input()
S = len(N)
a = N[:S//2]
b = N[(S+1)//2:]
if N == N[::-1] and a == a[::-1] and b == b[::-1]:
    print("Yes")
else:
  	print("No")

Solution (Python):
S = input()
N = len(S)
S1 = S[0:(N-1)//2]
S2 = S[(N+3)//2-1:N+1]
print("Yes" if S == S[::-1] and S1 == S1[::-1] and S2 == S2[::-1] else "No")

Solution (Python):
s = input()

n = len(s)
ans = 'No'

if s == s[::-1]:
  s_2 = s[:int((n - 1) / 2)]
  if s_2 == s_2[::-1]:
    s_3 = s[int((n + 3) / 2 - 1):]
    if s_3 == s_3[::-1]:
      ans = 'Yes'

print(ans)

Solution (Python):
def is_kaibun(st):
  f = True
  for x,y in zip(st, st[::-1]):
    if x != y:
      f = False
      break
  return f
 
S = input()
ans = False
if is_kaibun(S):
  if is_kaibun(S[:(len(S)-1)//2]):
    ans = is_kaibun(S[(len(S)+3)//2-1:])
if ans:
  print('Yes')
else:
  print('No')

Solution (Python):
S = input()
N = len(S)
A = []
for s in range(N):
    A.append(S[s])
B = []
C = []
B = A[:(N-1)//2]
C = A[(N+3)//2-1:N]
if B == C:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
n = len(s)
a = s[0:(n-1)//2]
b = s[(n+3)//2-1:n]
if s == s[::-1] and a == a[::-1] and b ==  b[::-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
from sys import exit
S = input()
N = len(S)
back_S = S[::-1]
if S != back_S:
    print("No")
    exit(0)

slice1_S = S[0:int((N-1)/2)]
back_s1S = slice1_S[::-1]
if slice1_S != back_s1S:
    print("No")
    exit(0)

slice2_S = S[int((N+3)/2)-1:N]
back_s2S = slice2_S[::-1]
if slice2_S != back_s2S:
    print("No")
    exit(0)

print("Yes")

Solution (Python):
import sys
S = input()
N = len(S)
con = int((N-1)/2)  


if N == 3:
    if S[0] == S[2]:
        print('Yes')
    else:
        print('No')
    sys.exit()


if con % 2 == 0:
    con20 = int(con/2-1)
    con21 = con20+1
    con30 = int(N-(N+3)/4)
    con31 = con30+1
    while con21 < con:
        if S[con20] != S[con21] or S[con20] != S[con31] or S[con21] != S[con30]:
            print('No')
            sys.exit()
        con20 = con20-1
        con21 = con21+1
        con30 = con30-1
        con31 = con31+1


else:
    con25 = int((con-1)/2)
    con35 = N-con25-1
    if S[con25] != S[con35]:
        print('No')
        sys.exit()
    con20 = con25-1
    con21 = con25+1
    con30 = con35-1
    con31 = con35+1
    while con21 < con:
        if S[con20] != S[con21] or S[con20] != S[con31] or S[con21] != S[con30]:
            print('No')
            sys.exit()
        con20 = con20-1
        con21 = con21+1
        con30 = con30-1
        con31 = con31+1

print('Yes')

Solution (Python):
s=str(input())
n=len(s)

for i in range(0,n):
 if s[i]!=s[-i-1]:
    print("No")
    exit()

new_n1=int((n-1)/2)
new_s1=s[:new_n1]

new_n2=int((n+3)/2)
new_s2=s[new_n2-1:]
for i in range(0,len(new_s1)):
 if new_s1[i]!=new_s1[-i-1]:
    print("No")
    exit()
else:
  pass
for i in range(0,len(new_s2)):
 if new_s2[i]!=new_s2[-i-1]:
    print("No")
    exit()
else:
  print("Yes")

Solution (Python):
S = input()
N = len(S)
res = False
P = []
L = []
K = []
for s in range(N):
    P.append(S[s])
L = P[:(N-1)//2]
K = P[(N+3)//2-1:N]
if L == K:
    res = True
if res:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
s = str(input())

for i in range(len(s)//2):
    if s[i] != s[-1-i]:
        print("No")
        sys.exit()

a = int((len(s)-1)/2)
b = int(((len(s)+3)/2)-1)
s1 = s[:a]
s2 = s[b:]

for i in range(len(s1)//2):
    if s1[i] != s1[-1-i] or s2[i] != s2[-1-i]:
        print("No")
        sys.exit()

print("Yes")

Solution (Python):


import sys
input=sys.stdin.readline

def main():
    S=input().strip("\n")
    N=len(S)
    s1=S[:(N-1)//2]
    s2=S[(N+3)//2-1:N]
    if S==S[::-1] and s1==s1[::-1] and s2==s2[::-1]:
        print("Yes")
    else:
        print("No")
            
    
if __name__=="__main__":
    main()

Solution (Python):
s=list(input())
length=len(s)
idx_half=int((length-1)/2)

if s==s[::-1] and s[:int((length-1)/2)]==s[int((length-1)/2)-1::-1] and s[int((length+3)/2-1):]==s[:int((length+3)/2-2):-1]:    
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
S = input()
n = len(S)
x = int((n-1)/2)
y = int(x/2)
for i in range(x) :
    if S[i] != S[n-i-1] :
        print("No")
        sys.exit()
for j in range(y) :
    if S[j] != S[x-j-1] :
        print("No")
        sys.exit()
    if S[x+j+1] != S[n-j-1] :
        print("No")
        sys.exit()   
print("Yes")

Solution (Python):
s = input()

s1=s[::-1]
s2=s[:(len(s)+1)//2-1]
s3=s[(len(s)+3)//2-1:]

if s1 == s1[::-1] and s2 == s2[::-1] and s3 == s3[::-1] :
  print("Yes")
else:
  print("No")

Solution (Python):
import itertools
import functools
import math
from collections import Counter
from itertools import combinations


S=input()

N=int(len(S))

A1=S[:N//2]
A2=S[((N+3)//2)-1:]


chk = 0

for i in range(N-1//2):
    if S[i]!=S[N-1-i]:
        chk = 1
        print('No')
        exit()

for i in range((N-1)//2):
    if A1[i] != A1[((N-1)//2) - (N%2) - i]:
        chk = 1
        break
    if A2[i] != A2[((N-1)//2) - (N%2) - i]:
        chk = 1
        break

if chk == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
S=list(input())
top_S = S[:len(S)//2]
S.reverse()
down_S = S[:len(S)//2]
if(top_S==down_S):
    top_top_S=top_S[:len(top_S)//2]
    top_S.reverse()
    top_down_S =top_S[:len(top_S)//2]
    down_top_S = down_S[:len(down_S)//2]
    down_S.reverse()
    down_down_S = down_S[:len(down_S)//2]
    if (top_top_S == top_down_S and down_top_S == down_down_S):
        print('Yes')
    else:
        print('No')
else:
    print('No')

Solution (Python):
def check(line):
    n = len(line)
    flag = True
    for i in range(n // 2):
        if line[i] != line[n - i - 1]:
            flag = False

    return flag

s = list(input())
n = len(s)
sf = s[:n//2]
sb = s[n//2 + 1:]
if sf != sb:
    print("No")
else:
    if check(sf):
        print("Yes")
    else:
        print("No")

Solution (Python):
s = list(input())
a = s[:len(s)//2]
b = s[len(s)//2+1:]
res = 0
if s[::-1] == s: res+=1
if a[::-1] == a: res+=1
if b[::-1] == b: res+=1
print("Yes" if res == 3 else "No")

Solution (Python):
S = input()
N = len(S)
N1s = (N-1)//2
N2s = (N+3)//2-1

if S[:N1s] == S[N2s:]:
    print("Yes")
else:
    print("No")

Solution (Python):
s=list(input())
n=len(s)
a=all([p==q for p,q in zip(s,reversed(s))])
b=all([p==q for p,q in zip(s[:(n-1)//2],reversed(s[:(n-1)//2]))])
c=all([p==q for p,q in zip(s[(n+3)//2-1:],reversed(s[(n+3)//2-1:]))])

if a and b and c:
  print('Yes')
else:
  print('No')

Solution (Python):
S = input()
d = int((len(S) - 1) / 2)
e = int((len(S) + 3) / 2)
if S == S[::-1] and S[0:d] == S[d - 1:: -1] and S[e - 1:] == S[int(len(S)): e - 2: -1]:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
d = int((len(s)-1) / 2)
e = int((len(s)+3) / 2)
if s == s[::-1] and s[0:d] == s[d-1::-1] and s[e-1:] == s[int(len(s)):e-2:-1]:
  print('Yes')
else:
  print('No')

Solution (Python):
import sys
X=input()
n=len(X)
if n%2==0:
    print("No")
    sys.exit()
ans="No"
def check(s): 
    return s == s[::-1] 
ans="No"
if check(X):
    if check(X[0:int((n-1)/2)]):
        if check(X[int(((n+3)/2)-1):]):
            ans="Yes"
print(ans)

Solution (Python):
import sys
X=input()
n=len(X)
if n%2==0:
    print("No")
    sys.exit()
ans="No"
def check(s): 
    return s == s[::-1] 
ans="No"
if check(X):
    if check(X[0:int((n-1)/2)]):
        if check(X[int(((n+3)/2)-1):]):
            ans="Yes"
print(ans)

Solution (Python):
s = input()

s_1=s[:((len(s)-1)//2)]
s_2=s[((len(s)+3)//2)-1:]



flag = True

for a in range(len(s)//2):
    if s[a] != s[-(a+1)]:
        flag =False

for a in range(len(s_1)//2):
    if s_1[a] != s_1[-(a+1)]:
        flag =False

for a in range(len(s_2)//2):
    if s_2[a] != s_2[-(a+1)]:
        flag =False

if flag:
    print("Yes")
else:
    print("No")

Solution (Python):
s=input()
n=len(s)
s1=s[:(n-1)//2]
s2=s[(n+3)//2-1:]
if s==s[::-1] and s1==s1[::-1] and s2==s2[::-1] :
    print("Yes")
else:
    print("No")

Solution (Python):
s=input()
n=len(s)
h=n//2
f=s[:h]
e=s[:-h-1]

if s==s[::-1] and f==f[::-1] and e==e[::-1]:
  print("Yes")
else:
  print("No")

Solution (Python):
S = list(input())

N = int(len(S))
mi = int((N-1)/2)
mo = int((N+3)/2-1)

if S[:mi] == S[mo:]:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()

first_sep = int((len(s) - 1) / 2)
second_sep = int((len(s) + 3) / 2) - 1

first = s[0:first_sep]
second = s[second_sep:]

s_rev = s[::-1]
first_rev = first[::-1]
second_rev = second[::-1]

if s == s_rev and first == first_rev and second == second_rev:
    print('Yes')
else:
    print('No')

Solution (Python):
s = str(input())
mid = (len(s) + 1)//2

def palin(st):
    return st == st[::-1]

print('Yes' if palin(s[0:mid-1]) and palin(s[mid:]) and palin(s) else 'No')

Solution (Python):
S = input()

n = len(S)

def is_palindrome(s):
    return s == s[::-1]

if all(map(is_palindrome, [S, S[:n//2], S[n//2+1:]])):
    print("Yes")
else:
    print("No")

Solution (Python):
def palin(x):
    
    if x == x[::-1]: return True
    return False

a = input()
n = len(a)
if palin(a) and palin(a[:int((n-1)/2)]) and palin(a[int((n+3)/2)-1:]):
    print("Yes")
else: print("No")

Solution (Python):
import sys
import itertools

import time
import math
 
sys.setrecursionlimit(10 ** 7)
 
from collections import defaultdict
 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines




S = input()
N = len(S)

l = S[:N//2]
r = S[N//2 + 1:]

if S == S[::-1] and l == l[::-1] and r == r[::-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
def f(t):
  n = len(t)
  ok = True
  for i in range(n // 2):
    if t[i] != t[n - 1 - i]:
      ok = False
      break
  return ok
N = len(s)
if f(s) and f(s[:(N - 1) // 2]) and f(s[(N + 3) // 2 - 1:]):
  print('Yes')
else:
  print('No')

Solution (Python):
string = input()

def palindrome(inp):
  if inp == inp[::-1]: return True
  else: return False

if palindrome(string) and palindrome(string[:int((len(string) -1)/2)]) and palindrome(string[int((len(string) +1)/2):]): print("Yes")
else: print("No")

Solution (Python):
s = input()
s_r = s[::-1]
ans = "No"
if s == s_r:
    ss = s[:int((len(s) - 1) / 2)]
    ss_r = ss[::-1]
    if ss == ss_r:
        sss = s[int((len(s) + 3) / 2) - 1:]
        sss_r = sss[::-1]
        if sss == sss_r:
            ans = "Yes"
print(ans)

Solution (Python):
def solve(s):
  if s != s[::-1]: return True
  ss = s[:len(s)//2]
  if ss != ss[::-1]: return True

S = input()
ans = "Yes" if not solve(S) else "No"
print(ans)

Solution (Python):
S = input()
N = len(S)

S1 = S[0:int((N-1)/2)]
S2 = S[int((N+1)/2):N]

cnt = 0
if S == S[::-1]:
  cnt += 1
if S1 == S1[::-1]:
  cnt += 1
if S2 == S2[::-1]:
  cnt += 1
  
if cnt == 3:
  print('Yes')
else:
  print('No')

Solution (Python):
def solve(s):
  if s != s[::-1]:   return False
  ss = s[:len(s)//2]
  if ss != ss[::-1]: return False
  else: return True
  
s = input()
ans = "Yes" if solve(s) else "No"
print(ans)

Solution (Python):
S=input()
s=S[::-1]
s2=list(S)
N1=int((len(S)-1)/2)
N2=int((len(S)+3)/2)-1
a1=[]
a2=[]
for i in range(0,N1):
    a1.append(s2[i])
T=''.join(a1)
t=T[::-1]
for i in range(N2,len(S)):
    a2.append(s2[i])
U=''.join(a2)
u=U[::-1]
if S==s and U==u and T==t:
    print('Yes')
else:
    print('No')

Solution (Python):
s=input()
n=len(s)
if n%2==0 or s!=s[-1::-1]:
    print("No")
else:
    if s[:(n-1)//2]==s[(n-1)//2-1::-1] and s[(n+3)//2-1:]==s[-1:(n+3)//2-2:-1]:
        print("Yes")
    else:
        print("No")

Solution (Python):
s = input()
l = len(s)//2
s_ = s[::-1]
s1 = s[:l]
s1_ = s1[::-1]
s2 = s[l+1:]
s2_ = s2[::-1]
 
if s == s_ and s1 == s1_ and s2 == s2_:
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()
N = int(len(S))
S2 = S[:(N-1)//2]
if S == S[::-1]:
    if S2 == S2[::-1]:
        print("Yes")
    else:
        print("No")
    
else:
    print("No")

Solution (Python):
def main():
    s = str(input())
    n = len(s)
    len1 = int((n-1)/2)
    s1 = s[:len1]
    len2 = int((n+1)/2)
    s2 = s[len2:]
    if (s == s[::-1]) & (s1 == s1[::-1]) & (s2 == s2[::-1]):
            print('Yes')
    else:
        print('No')
        
main()

Solution (Python):
s = input()
n = int(len(s))
s2 = s[:(n-1)//2]
if s == s[::-1]:
    if s2 == s2[::-1]:
        print("Yes")
    else:
        print("No")
    
else:
    print("No")

Solution (Python):
s = input()
n = len(s)
sformer = s[:int((n - 1) / 2)]
slatter = s[int((n + 1) / 2):]
if s == s[-1::-1] and sformer == sformer[-1::-1] and slatter == slatter[-1::-1]:
  print('Yes')
else:
  print('No')

Solution (Python):


s = input()
pd = False

if s[::-1] == s:
    n1 = (len(s) - 1) // 2
    s1 = s[:n1]
    if s1 == s1[::-1]:
        n2 = (len(s) + 3) // 2
        s2 = s[n2-1:]
        if s2 == s2[::-1]:
            pd = True

if pd:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
read = sys.stdin.read
def main():
    s = input()
    lens = len(s)
    mae_end = (lens - 1) // 2
    mae = s[:mae_end]
    if mae != mae[::-1]:
        print('No')
        sys.exit()
    ushiro_start = (lens+3) // 2 - 1
    ushiro = s[ushiro_start:]
    if mae != ushiro[::-1]:
        print('No')
        sys.exit()
    print('Yes')

if __name__ == '__main__':
    main()

Solution (Python):
S = input()
len_S = len(S)

if len_S%2==1 and S[0:(len_S-1)//2]==S[(len_S+1)//2:]:
  print("Yes")
else:
  print("No")

Solution (Python):
s = input()
n = len(s)

s_top = s[0:(n-1)//2]
s_bottom = s[(n+3)//2-1:]
if s_top == s_top[::-1] and s_bottom == s_bottom[::-1] and s == s[::-1]:
    print('Yes')
else:
    print('No')

Solution (Python):
S = str(input())
N = len(S)
ans = 'Yes'
for i in range((N-1)//2):
    if S[i] != S[N-1-i]:
        ans = 'No'
        break

for i in range(((N-1)//2)//2):
    if S[i] != S[(N-1)//2-1-i]:
        ans = 'No'
        break
    if S[(N-1)//2+1+i] != S[N-1-i]:
        ans = 'No'
        break
            
print(ans)

Solution (Python):
s=input()
n=len(s)
sa=s[:(n-1)//2]
sb=s[(n+1)//2:]
sar=""
sbr=""
for i in range(len(sa)):
    sar+=sa[len(sa)-i-1]
    sbr+=sb[len(sa)-i-1]
if sar==sa and sbr==sb and sa==sb:
    print("Yes")
    exit()
print("No")

Solution (Python):

import sys


S = str(sys.stdin.readline())
N = len(S)
S = S[0:N-1]
N = len(S)
S_1 = S[0:int((N-1)/2)]
S_2 = S[int((N+3)/2-1):N]







if S == S[::-1] and S_1 == S_1[::-1] and S_2 == S_2[::-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()
N = len(S)

def isPalindrome(s):
    return s == s[::-1]

left = S[:N//2]
right = S[(N+2)//2:]
if isPalindrome(S) and (left == right):
    print("Yes")
else:
    print("No")

Solution (Python):
import numpy as np
def cumsum(x):
    return list(np.cumsum(x))

def cumsum_number(N,K,x):
    ans=[0]*(N-K+1)
    number_cumsum = cumsum(x)
    number_cumsum.insert(0,0)
    for i in range(N-K+1):
        ans[i]=number_cumsum[i+K]-number_cumsum[i]
    return ans
"""
int 
float 


for name in fruits: 
    print(name)


list0 = [] 
list0 = [1,2,3,4] 
list0 = [0]*10 
list1= [i for i in range(10)] 
list1 = list(map(int, input().split()))　
number=[int(input()) for i in range(int(input()))] 
list1 = list1 + [6, 7, 8] 
list2.append(34) 
list.insert(3,10) 
len(list4) 
max(sa) 
list5.count(2) 
list1.sort() 
list1.sort(reverse=True)  
set(list1) 
sum([2,3,   ,3]) 

abs(a) 
max(a,b) min(a,b) 
text1 = text1.replace("34","test") 

exit(0) 

cumsum(リスト) 
cumsum_number(N,K,x) 
"""
S=list(input())
SS=S[0:(len(S)-1)//2]
SSS=S[(len(S)+3)//2:-1]
Sreverse=S[::-1]
if S==S[::-1] and SS==SS[::-1] and SSS==SSS[::-1]:
        print("Yes")
else:
    print("No")

Solution (Python):
s = input()
l = len(s)//2
s_ = s[::-1]
s1 = s[:l]
s1_ = s1[::-1]
s2 = s[l+1:]
s2_ = s2[::-1]

if s == s_ and s1 == s1_ and s2 == s2_:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
l = len(s)//2
s_ = s[::-1]
s1 = s[:l]
s1_ = s1[::-1]
s2 = s[l+1:]
s2_ = s2[::-1]

if s == s_ and s1 == s1_ and s2 == s2_:
    print("Yes")
else:
    print("No")

Solution (Python):

S = input()
T = S[::-1]
c = len(S)//2
ans = 'No'
if S==T and S[:c]==T[c+1:] and S[c+1:]==T[:c]:
    ans = 'Yes'
print(ans)

Solution (Python):
S = input()
S1 = S[:int((len(S)-1)/2)]
S2 = S[int((len(S)+3)/2)-1:]
print('Yes' if S == S[::-1] and S1 == S1[::-1] and S2 == S2[::-1] else 'No')

Solution (Python):
s = input()
n = len(s)

if s != s[::-1]:
    print('No')
    exit()

s1 = s[:(n - 1) // 2]
if s1 != s1[::-1]:
    print('No')
    exit()

s2 = s[(n + 3) // 2 - 1:]
if s2 != s2[::-1]:
    print('aaa')
    print('No')
    exit()

print('Yes')

Solution (Python):
s = input()
n = len(s)

for i in range(n):
    if s[i] != s[n - i - 1]:
        print('No')
        break
else:
    last = (n - 1) // 2
    for i in range(last):
        if s[i] != s[last - i - 1]:
            print('No')
            break
    else:
        start = ((n + 3) // 2) - 1
        for i in range(start, n):
            if s[i] != s[last + start - i - 1]:
                print('No')
                break
        else:
            print('Yes')

Solution (Python):
S = input()
N = len(S)
  
cnt = 0

Srev = ""
for i in range(1, N + 1):
  Srev += S[-1*i]
if S == Srev:
  cnt += 1
  
S1 = S[0:(N - 1)//2]
S1rev = ""
for i in range(1, len(S1) + 1):
  S1rev += S1[-1*i]
if S1 == S1rev:
  cnt += 1
  
S2 = S[(N + 3)//2 - 1:N + 1]
S2rev =""
for i in range(1, len(S2) + 1):
  S2rev += S2[-1*i]
if S2 == S2rev:
  cnt += 1

if cnt == 3:
  print("Yes")
else:
  print("No")

Solution (Python):
def kaibun(s):
  l=len(s)
  if(l%2==0):
    for i in range(l//2):
      if(s[i]!=s[l-1-i]):
        return 0
    return 1
  else:
    for i in range((l-1)//2):
      if(s[i]!=s[l-1-i]):
        return 0
    return 1

s=input()
l=len(s)
if(l%2==0):
  print("No")
else:
  if(kaibun(s[:((l-1)//2)])*kaibun(s)):
    print("Yes")
  else:
    print("No")

Solution (Python):
S = input()
def isKaibun(S):
    if S != S[::-1]:
        return False
    return True

def main(S):
    if isKaibun(S)==False:
        return "No"
    N=len(S)
    S_1 = S[0:int((N-1)/2)]
    if isKaibun(S_1)==False:
        return "No"
    S_2 = S[int((N+3)/2)-1:N]
    if isKaibun(S_2)==False:
        return "No"
    return "Yes"

print(main(S))

Solution (Python):
def main():
    s = input()
    s1 = s[0:int((len(s)-1)/2)]
    s2 = s[int((len(s)+3)/2)-1:len(s)]
    print('Yes') if s == s[::-1] and s1 == s1[::-1] and s2 == s2[::-1] else print('No')


if __name__ == "__main__":
    main()

Solution (Python):
s=input()
n=len(s)
c=0
for i in range((n-1)//2):
    if s[i]!=s[n-1-i]:
        c=1
        break
if c>0:
    print('No')
else:
    for i in range((n-1)//2):
        if s[i]!=s[(n-1)//2-i-1]:
            c=1
            break
    if c>0:
        print('No')
    else:
        for i in range((n+3)//2,n):
            if s[i]!=s[n-i-1]:
                c=1
                break
        if c>0:
            print('No')
        else:
            print('Yes')

Solution (Python):
s = input()
s_rev = s[::-1]

center = (len(s)+1)//2
s_firsthalf = s[0:center-1]

s_firsthalf_rev = s_firsthalf[::-1]
if s == s_rev and s_firsthalf == s_firsthalf_rev:
    print('Yes')
else:
    print('No')

Solution (Python):
S=input()
a=len(S)
b=S[:int((a-1)//2)]
c=b[::-1]
d=S[int((a+3)//2)-1:]
e=d[::-1]
f=S[::-1]
if b==c and d==e and S==f:
  print('Yes')
else:
  print('No')

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    S = input()
    n = len(S)

    if S == S[::-1]:
        ss = S[: n // 2]
        if ss == ss[::-1]:
            print("Yes")
        else:
            print("No")
    else:
        print("No")


if __name__ == '__main__':
    resolve()

Solution (Python):
s = input()
mid = len(s)//2
flag = 1
for i in range(len(s)//2+1):
    if s[mid-i] == s[mid+i]:
        continue
    else:
        flag = 0

t = s[:(len(s)-1)//2]

for i in range(len(t)):
    if t[i] == t[~i]:
        continue
    else:
        flag = 0

t = s[(len(s)+1)//2:]

for i in range(len(t)):
    if t[i] == t[~i]:
        continue
    else:
        flag = 0

if flag == 1:
    print("Yes")
else:
    print("No")

Solution (Python):
s = str(input())
n = len(s)
def func(s):
    n = len(s)
    for i in range(n//2):
        if s[i] != s[n-1-i]:
            return False
    else:
        return True

if func(s[0:(n-1)//2]) and func(s[(n+3)//2-1:]) and func(s):
    print('Yes')
else:
    print('No')

Solution (Python):
s=input()
n=len(s)
if s==s[::-1] and s[:(n-1)//2]==s[:(n-1)//2][::-1] and s[(n+3)//2-1::]==s[(n+3)//2-1::][::-1]:
  print("Yes")
else:
  print("No")

Solution (Python):
S = input()
N = len(S)

S2 = S[:int((N-1)/2)]
S3 = S[int((N+3)/2)-1:N+1]


if S == S[::-1] and S2 == S2[::-1] and S3 == S3[::-1]:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
n = len(s)
a = s[::-1]

ans = "Yes"
if s != a: ans = "No"
elif s[:(n-1)//2] != s[(n+3)//2-1:]: ans = "No"
print(ans)

Solution (Python):
def check():
    S = input()
    N = len(S)
    if S[:(N-1)//2]==S[:(N-1)//2][::-1] and S==S[::-1]:
        return 'Yes'
    return 'No'
print(check())

Solution (Python):
import sys
s=input()
n=len(s)
for i in range(n//2):
  if s[i]!=s[n-1-i]:
    print('No')
    sys.exit()
for i in range(n//4):
  if s[i]!=s[n//2-1-i]:
    print('No')
    sys.exit()
  if s[n//2+1+i]!=s[n-1-i]:
    print('No')
    sys.exit()
print('Yes')

Solution (Python):
import math
import string
import collections
from collections import Counter
from collections import deque
from decimal import Decimal
import sys
import fractions
from operator import itemgetter
import itertools
import copy


def readints():
    return list(map(int, input().split()))


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor



dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]

s = input()
n = len(s)
a = s[:(n-1)//2]
b = s[((n+3)//2)-1:]
if a == b:
    print('Yes')
    exit()
print('No')

Solution (Python):
S = input().strip()
N = len(S)
x = S[:(N-1)//2]
y = S[(N+3)//2-1:]
if S==S[::-1] and x==x[::-1] and y==y[::-1]:
    print("Yes")
else:
    print("No")

Solution (Python):






from collections import deque,defaultdict











import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
s = input()
ln = len(s)
if s == s[::-1]:
    front = s[:(ln-1)//2]
    back = s[(ln+3)//2-1:]
    
    if front == front[::-1] and back == back[::-1]:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Solution (Python):
import sys
input = sys.stdin.readline
from collections import *

S = input()[:-1]
N = len(S)
S1 = S[:N//2]
S2 = S[N//2+1:]

if S==S[::-1] and S1==S1[::-1] and S2==S2[::-1]:
    print('Yes')
else:
    print('No')

Solution (Python):
x = input()
if len(x) % 2 == 0 :
  adjust = 0
else:
  adjust = 1
xa = x[0:(len(x)-adjust)//2]
xb = x[(len(x)+3)//2-1:]
xar = ''.join(list(reversed(xa)))
xbr = ''.join(list(reversed(xb)))

if xa == xb and xar == xbr:
  print('Yes')
else:
  print('No')

Solution (Python):
s = str(input())
N = len(s)
kai = 0
for i in range(int((N+1)/2)-1):
    if s[i] == s[int(i+(N+1)/2)] and kai == 0:
        kai = 0
    else:
        kai = 1

if kai == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
n = len(s)
def f(a,b):
  X = s[a-1:b]
  Y = X[-1::-1]
  if X == Y:
    return(1)
  else:
    return(0)
  
if f(1,n) * f(1,(n-1)//2) * f((n+3)//2,n) == 1:
  print("Yes")
else:
  print("No")

Solution (Python):
S = input()
N = (len(S)-1)//2
M = (len(S)+3)//2
count = 0

if S[::-1] == S:
  if S[:N] == S[:N][::-1]:
    if S[(M-1):] == S[(M-1):][::-1]:
      count += 1
print("Yes" if count == 1 else "No")

Solution (Python):
s=str(input())
s=list(s)
n=len(s)
temp=0
for i in range(n//2):
  if s[i]!=s[n-1-i]:
    temp=1
    break
for i in range(n//4):
  if s[i]!=s[(n-1)//2-1-i]:
    temp=1
    break
  if s[(n+3)//2-1+i]!=s[n-1-i]:
    temp=1
    break
if temp==0:
  print("Yes")
else:
  print("No")

Solution (Python):
import math as mt


def ro(n):
  return mt.floor(mt.sqrt(n))
def ya():
  print("Yes")
  return
def na():
  print("No")
  return





s=input()

n=(len(s)+1)//2
if s[:n-1]!=s[n:] or s!=s[::-1]:
  na()
else:
  ya()

Solution (Python):
S=input()
N=len(S)
print("Yes" if S==S[::-1] and S[:int((N-1)/2)]==S[:int((N-1)/2)][::-1] and S[int((N+3)/2)-1:]==S[int((N+3)/2)-1:][::-1] else "No")

Solution (Python):






s = input()
r = s[::-1]
ans = "Yes"

if s==r:
    for i in range(int(len(s)/2)):
        if s[i] != s[int(len(s)/2)+i+1]:
            ans = "No"
else:
    ans = "No"

print(ans)

Solution (Python):
S=input()
R=S[::-1]
T=S[:int((len(S)-1)/2)]
U=T[::-1]
V=S[-int((len(S)-1)/2):]
W=V[::-1]
if S==R and T==U and V==W:
  print("Yes")
else:
  print("No")

Solution (Python):
s=input()
ans='No'
if s==s[::-1]:
  t=s[:len(s)//2]
  if t==t[::-1]:
    u=s[len(s)//2+1:]
    if u==u[::-1]:
      ans='Yes'
print(ans)

Solution (Python):
S = input()
def palin_check(str):
    rstr = str[::-1]
    slen = len(str) if len(str) % 2 == 0 else len(str)-1
    if str[:int(slen/2)] != rstr[:int(slen/2)]:
        return "No"
    else:
        return "Yes"

if palin_check(S) == "No":
    print("No")
else:
    if palin_check(S[:int((len(S)-1)/2)]) ==  'No':
        print("No")
    else:
        print("Yes")

Solution (Python):
S = input()

flag = 1
N = len(S)+1

if S != S[::-1]:
    flag = 0

Stemp = S[0:int(N/2-1)]

if S[0:int(N/2-1)] != Stemp[::-1]:
    flag = 0

Stemp = S[int((N+2)/2-1):]
if S[int((N+2)/2-1):] != Stemp[::-1]:
    flag = 0

if flag == 1:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
s_len = len(s)
s1 = s[0:int((s_len - 1) / 2)]
s2 = s[int((s_len + 3) / 2) - 1:s_len]
if s1 == s1[::-1] and s2 == s2[::-1] and s == s[::-1]:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
n = len(s)

sa = s[:(n - 1) // 2]
sb = s[(n + 1) // 2:]

if s == s[::-1] and sa == sa[::-1] and sb == sb[::-1]:
  print("Yes")
  
else:
  print("No")

Solution (Python):
s = list(input())
n = len(s)
s_1 = s[0:int((n-1)/2)]
s_2 = s[int((n+3)/2-1):n]

if s == list(reversed(s)) and s_1 == list(reversed(s_1)) and s_2 == list(reversed(s_2)):
  print("Yes")

else:
  print("No")

Solution (Python):
S = input()
L = S[:len(S)//2]
R = S[(len(S)+1)//2:]

L1 = L[:len(L)//2]
L2 = L[(len(L)+1)//2:]
R1 = R[:len(R)//2]
R2 = R[(len(R)+1)//2:]

if (L1==L2[::-1]) and (R1==R2[::-1]) and (L==R[::-1]):
    print('Yes')
else:
    print('No')

Solution (Python):
S = input()
B = int((len(S) - 1) / 2)
A = S[:B]

if S == str(S)[::-1] and A == str(A)[::-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()
N = len(S)
S1 = S[0:(N-1)//2]
S2 = S[(N+3)//2-1]

if (S == S[::-1]) and (S1 == S1[::-1]) and (S2 == S2[::-1]):
    
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
sa = s[:len(s)//2]
sb = s[len(sa)+3//2:]
if s == s[::-1] and sa == sa[::-1] and sb == sb[::-1]:
    print('Yes')
else:
    print('No')

Solution (Python):
S=input()
check1=S[0:len(S)//2]
check2=S[1+len(S)//2:]
if S==S[::-1] and check1==check1[::-1] and check2==check2[::-1]:
  print("Yes")
else:
  print("No")

Solution (Python):
s = input()
n = len(s)
a = s[:(n - 1) // 2]
b = s[(n + 1) // 2:]
if s == s[::-1] and a == a[::-1] and b == b[::-1]:
    print("Yes")
else:
    print("No")

Solution (Python):

S = input()
flag = False
if S == S[::-1]:
    if S[:(len(S)-1)//2] == S[:(len(S)-1)//2][::-1]:
        if S[(len(S)+3)//2-1:] == S[(len(S)+3)//2-1:][::-1]:
            flag = True
if flag:
    print("Yes")
else:
    print("No")