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



Sample input:
akasaka


Sample output:
Yes

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = list(input())
n = len(s)

def kaibun(st):
  sta = list()
  for k in range(len(st)//2):
    sta.append(st[k])
  for k in range(len(st)//2):
    if st[-(-len(st)//2)+k] != sta.pop():
      return False
  return True

if kaibun(s) == False:
  print('No')
elif kaibun(s[:(n-1)//2]) == No:
  print('No')
elif kaibun(s[(n+3)//2-1:]) == No:
  print('No')
else:
  print('Yes')

Submission status: Runtime Error

Solution code:
s = input()

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

Submission status: Runtime Error

Solution code:
s = input()

n = len(s)
front_s = s[:(n-1)//2]
back_s = s[(n+3)//2-1:]
n1 = len(front_s)

if front_s == back_s[::-1]:
  if (n-1)//2%2 == 1:
    if front_s[:(n1-1)//2] == (front_s[(n1+3)//2-1:])[-1] and back_s[:(n1-1)//2] == (back_s[(n1+3)//2-1:])[::-1]:
      print('Yes')
    else:
      print('No')
  else:
    if front_s[:n1//2] == (front_s[n1//2:])[-1] and back_s[:n1//2] == (back_s[n1//2:])[::-1]:
      print('Yes')
    else:
      print('No')
else:
  print('No')

Submission status: Runtime Error

Solution code:
S = input()
N = len(S)
a = S[0:(N-1)//2]
b = S[(N+3)//2-1:]


def k(a):
    for i in ragne(len(a)):
        if a[i] != a[len(a)-1-i]:
            return False
        else:
            return True

if k(S) & k(a) & k(b):
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
s = input()
for i in range(0,len(s)//2):
  if (s[i]!=s[-i-1]):
    print("No")
    break
  if (i == len(s)//2-1)
    print("Yes")

Submission status: Runtime Error

Solution code:
s = input()
for i in range(1,len(s)/2):
  if (s[i-1]!=s[-i]):
    print("No")
print("Yes")

Submission status: Runtime Error

Solution code:
s = input()
if s == s.reverse():
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s= input()
l = list(s)
ans= "Yes"
if(s != s[::1]):
    ans = "No"
    break
else:
    s1 = s[:len(s)//2]
    s2 = s[len(s)//2+1:]
    if s1!=s2:
        print("No")
    else:
        print("Yes")
print(ans)

Submission status: Runtime Error

Solution code:
S=input()
ans="Yes"
if all(a==b for a,b in zip(S,reversed(S))):
    if all(a==b for a,b in zip(S,reversed(S[:N//2]))):
            pass
    else:
        ans="No"
else:
    ans="No"
print(ans)

Submission status: Runtime Error

Solution code:
S = input()
N = len(S)
a = S[1:(N-1)/2+1]
b = s[(N+3)/2:]

def kaibun(l):
    for i in range(len(l)):
        if l[i] != l[-i]:
            return(False)
    return(True)

if kaibun(S) & kaibun(a) & kaibun(b):
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
s=input()
n=len(s)
part=[]

for i in range(int((n-1)/2)):
  if s[i]==s[int(((n-1)/2)-i-1)]:
    part.append(s[i])
  else:
    print("No")
    exit()
    
for i in range(int((n-1)/2)):
  if s[i+1+int((n-1)/2)]!=s[int(((n-1)/2))-i+int((n-1)/2)] or s[i]!=s[i+1+int((n-1)/2)]:
    priint("No")
    exit()
    
print("Yes")

Submission status: Runtime Error

Solution code:
akasaka

Submission status: Runtime Error

Solution code:
s = input()
n = len(s)
l = (n - 1) // 2
m = n // 4
for i in range(m):
  if s[i] != s[l - i - 1] or s[i] != s[l + i + 1] or s[i] != s[n - i - 1]:

Submission status: Runtime Error

Solution code:
''' python---code_marshal
'''

x=raw_input();ch1,ch2=True,True
s1=x[:(len(x)-1)/2];s2=x[(len(x)+3)/2-1:]
b=0;e=len(s1)-1
while b<>e:
    if s1[b]<>s1[e]:ch1=False;break
    b+=1;e-=1
b=0;e=len(s2)-1
while b<>e:
    if s2[b]<>s2[e]:ch2=False;break
    b+=1;e-=1
if ch1 and ch2:print"Yes"
else:print"No"

Submission status: Runtime Error

Solution code:
S = input()
c = True
for i in range (len(S)//2):
  if S[i]=S[len(S)//2-i-1]=S[len(S)//2+1+i]=S[len(S)-i-1]:
    c = True
  else:
    c = False
if (c):
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
s=input()
n=len(s)
for i in range(n):
    if not s[i]==s[n-1-i]:
        print('No')
        quit()
for i in range(int(n*(n-1)/2)):
    if not s[i]==s[int((n*(n-1))/2)-1-i]:
        print('No')
        quit()
for i in range(int(n*(n-1)/2)):
    if not s[int(n*(n+3)/2)-1+i]==s[n-1-i]:
        print('No')
        quit()
else:
    print('Yes')

Submission status: Runtime Error

Solution code:
S = input()
N = len(S)
 
front = S[:(N-1)/2]
back = S[-1:-(N+3)/2+1:-1]
 
if front == back:
  l = len(front)
  f_front = front[:(l-1)/2]
  f_back = front[-1:-(l+3)/2+1:-1]
  if f_front == f_back:
    b_front = back[::-1][:(l-1)/2]
    b_back = back[::-1][-1:-(l+3)/2+1:-1]
    if b_front == b_back:
      print('Yes')
    else:
      print('No')
  else:
    print('No')
else:
  print('No')

Submission status: Runtime Error

Solution code:
S = input()
N = len(S)
 
front = S[:(N-1)/2]
back = S[-1:-(N+3)/2+1:-1]
 
if front == back:
  l = len(front)
  f_front = front[:(l-1)/2]
  f_back = front[-1:-(l+3)/2+1:-1]:
  if f_front == f_back:
    b_front = back[::-1][:(l-1)/2]
    b_back = back[::-1][-1:-(l+3)/2+1:-1]:
    if b_front == b_back:
      print('Yes')
    else
      print('No')
  else:
    print('No')
else:
  print('No')

Submission status: Runtime Error

Solution code:
S = input()
N = len(S)
 
front = S[:(N-1)/2]
back = S[-1:-(N+3)/2+1:-1]

if front == back:
  l = len(front)
  f_front = front[:(l-1)/2]
  f_back = front[-1:-(l+3)/2+1:-1]:
  if f_front == f_back:
    b_front = back[:(l-1)/2]
    b_back = back[-1:-(l+3)/2+1:-1]:
    if b_front == b_back:
      print('Yes')
    else
      print('No')
  else:
    print('No')
else:
  print('No')

Submission status: Runtime Error

Solution code:
S = input()
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")

Submission status: Runtime Error

Solution code:
li=list(input())
n=len(li)
x=1
y=int((n-1)/2-x+1)
X='a'
Y='a'
while X==Y:
    X=li[x]
    Y=li[y]
    x+=1
    if x == (n+1)/4:
        print('Yes')
        break
    else:
        continue
if x != (n+1)/4: 
    print('No')

Submission status: Runtime Error

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

front = S[:(N-1)/2]
back = S[-1:-(N+3)/2+1:-1]:

if front == back:
  l = len(front)
  f_front = front[:(l-1)/2]
  f_back = front[-1:-(l+3)/2+1:-1]:
  if f_front == f_back:
    b_front = back[:(l-1)/2]
    b_back = back[-1:-(l+3)/2+1:-1]:
    if b_front == b_back:
      print('Yes')
    else
      print('No')
  else:
    print('No')
else:
  print('No')

Submission status: Runtime Error

Solution code:
l=list(input())
def kaibun(c):
  d=c[::-1]
  if c = d:
    return 0
  else:
    return 1
a=kaibun(l)
m=l[:int((len(l)-1)/2)]
n=l[int((len(l)+1)/2):]

b=kaibun(m)
c=kaibun(n)

if a+b+c==0:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S=input()
N=len(S)
cnt=0
cnt1=0
cnt2=0
for i in range (N):
    if S[i]==S[N-1-i]:
        cnt+=1
 
if cnt==N:
    for j in range((N-1)//2):
        if  S[j]==S[(N-1)//2 -1-j]:
            cnt1+=1
    if cnt1==(N-1)//2:
        for k in range((N-1)//2):
            if S[(N+3)//2 -1+k]==S[N-1-k]:
                cnt2+=1
    else:
        print("No")
		exit()
    if cnt2==(N-1)//2:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def is_palindrome(str):
  i, j = 0, len(str)-1
  while i >= j:
    if str[i] != str[j]:
      return False
    i += 1
    j -= 1

  return True

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

Submission status: Runtime Error

Solution code:
def is_palindrome(str):
  i, j = 0, len(str)-1
  while i != j:
    if str[i] != str[j]:
      return False
    i += 1
    j -= 1

  return True

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

Submission status: Runtime Error

Solution code:
def is_palindrome(str):
  i, j = 0, len(str)-1
  while i != j:
    if str[i] != str[j]:
      return False
    i += 1
    j -= 1

  return True

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

Submission status: Runtime Error

Solution code:
def is_palindrome(str):
  i, j = 0, len(str)-1
  while i != j:
    if str[i] != str[j]:
      return False
    i += 1
    j -= 1

  return True

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

Submission status: Runtime Error

Solution code:
# 1. S is Palindrome
# 2. S[1, (N-1)//2]
# 3. S[(N+3)//2, N]

def is_palindrome(str):
  i, j = 0, len(str)-1
  while i != j:
    if str[i] != str[j]:
      return False
    i += 1
    j -= 1

  return True

s = input()
n = len(s)
print(is_palindrome(s) and is_palindrome(s[0:((n-1)//2)]) and is_palindrome(s[(n+3)//2-1:n]))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input()

def kaibun1(w):
  w = str(w)
  t = len(w)
  n = 1
  while n < t//4:
    if w[n-1] == w[(t-1)//2 - (n-1)]:
      n += 1
    else:
      return False
      break

def kaibun2(w):
  w = str(w)
  t = len(w)
  m = 1
  while m < t//4:
    if w[t+3//2-1+(m-1)] == w[t-(m-1)]:
      m += 1
    else:
      return False
      break
if len(s) == 3:
  if s[0] == s[2]:
    print('Yes')
  else:
    print('No')
else:      
  if kaibun1(s)  is False or kaibun2(s) is False:
    print('No')
  else:
    print('Yes')

Submission status: Runtime Error

Solution code:
s = input()

def kaibun1(w):
  w = str(w)
  t = len(w)
  n = 1
  while n < t//4:
    if w[n-1] == w[(t-1)//2 - (n-1)]:
      n += 1
    else:
      return False
      break

def kaibun2(w):
  w = str(w)
  t = len(w)
  m = 1
  while m < t//4:
    if w[t+3//2-1+(m-1)] == w[t-(m-1)]:
      m += 1
    else:
      return False
      break
if kaibun1(s)  is False or kaibun2(s) is False:
  print('No')
else:
  print('Yes')

Submission status: Runtime Error

Solution code:
S = str(input())
f = []
l = []
ans = 'Yes'
for i in range((len(S)-1)/2):
    f.append(S[i])
    l.append(S[-i-1])
if f == l

Submission status: Runtime Error

Solution code:
def check()
string=input()
stringLength=len(string)
if stringLength>=7 and stringLength%2!=0:
  middle=len(string)/2
  left=string[0: middle]
  right=string[(middle+1):]
  if left==right:
    if left[0:int(middle/2)]==left[(int(middle/2)+1):]: return "Yes"
return "No"    

print(check())

Submission status: Runtime Error

Solution code:
S = str(input())

N=len(S)

s1=S[:(N-1)/2]
s2=S[(N+3)/2:]

if s1==s2:
	print("Yes")
else:
	print("No")

Submission status: Runtime Error

Solution code:
S = input()
for i in s:
  if s[i] == s:
    print("yes")
  else:
    print("No")

Submission status: Runtime Error

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

front = s[:(n-1)//2]
rear = s[(n+1)//2:]

if s == s[::-1] and front == front[::-1] ans rear == rear[::-1]:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
S = input()

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

ans = true

if kaibunn_boolean(S) and kaibunn_boolean(S[:3]):
  ans = kaibunn_boolean(S)

if ans:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
 = input()
flag = True
for i in range((len(s)-1)//2):
	if s[i] == s[len(s)-i-1]:
		continue
	else:
		flag = False
		break

if flag:
	left = s[:(len(s)-1)//2]
	right = s[(len(s)+3)//2-1:]
	if left == right:
		print("Yes")
	else:
		print("No")
else:
	print("No")

Submission status: Runtime Error

Solution code:
s = input()
d = len(s)//2
print("Yes" if s[:d] == s[d+1:] "No" else)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
# 入力
s = input()

# 処理
leftLen :int = len(s) // 2 # 文字列の長さの半分
left :str = s[:leftLen] # sの左半分

# leftの回文チェック
leftLenHalf :int = leftLen // 2
isPalindromeLeft :bool = True
for i in range(0, leftLenHalf - 1):
	if left[i] != left[leftLenHalf - i]:
		isPalindromeLeft = False

# 全体の回文チェック
right :str = s[leftLen * -1:] # sの右半分
isPalindrome :bool = isPalindromeLeft and left == right

# 結果
result :str = "Yes" if isPalindrome else "No"

# 出力
print(result)

Submission status: Runtime Error

Solution code:
a = input();
cnt = 0;
if(a == a[::-1]):
	cnt+=1
n = len(a)
if(a[:(n-1)//2] == a[:(n-1)//2:-1):
    cnt+=1
if(a[(n+3)//2::-1] == a[(n+3)//2:]):
    cnt+=1
if(cnt == 3):
    print("Yes")
else:
   	print("No")

Submission status: Runtime Error

Solution code:
s = input()


def reverse(text):
    return text == ''.join(list(reversed(text)))


N = len(s)

if reverse(s) and reverse(s[:(N-1)/2]) and reverse(s[(N+3)/2 - 1:]):
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
palindrom = str(input())
if palindrom != palindrom[::-1]:
  return "No"
else:
  return "Yes"

Submission status: Runtime Error

Solution code:
palindrom = input()
if palindrom != palindrom[::-1]:
  return "No"
n = (len(palindrom)-1)/2
if palindrom[:n] != palindrom[:n:-1]:
  return "No"
n2 = (len(palindrom)+3)/2
if palindrom[:n2] != palindrom[:n2:-1]:
  return "No"
else:
  return "Yes"

Submission status: Runtime Error

Solution code:
palindrom = input()
if palindrom != palindrom[::-1]:
	return "No"
n = (len(palindrom)-1)/2
if palindrom[:n] != palindrom[:n:-1]:
	return "No"
n2 = (len(palindrom)+3)/2
if palindrom[:n2] != palindrom[:n2:-1]:
	return "No"
else
	return "Yes"

Submission status: Runtime Error

Solution code:
palindrom = input()
if palindrom != palindrom[::-1]:
  return "No"
n = (len(palindrom)-1)/2
if palindrom[:n] != palindrom[:n:-1]:
  return "No"
n2 = (len(palindrom)+3)/2
if palindrom[:n2] != palindrom[:n2:-1]:
  return "No"
else
	reutn "Yes"

Submission status: Runtime Error

Solution code:
S = input()
l = len(S)

S1 = S[0:(l-1)//2]
S2 = S[(l+3)//2]

def Kaibun(Str):
	return Str == Str[::-1]:

if Kaibun(S) and Kaibun(S1) and Kaibun(S2):
	print("Yes")
else:
	print("No")

Submission status: Runtime Error

Solution code:
S = input()
l = len(S)

S1 = S[0:(l-1)//2]
S2 = S[(l+3)//2]

def Kaibun(Str):
	return Str == Str[::-1]:

if Kaibun(S) and Kaibun(S1) and Kaibun(S2):
		print("Yes")
	else:
		print("No")

Submission status: Runtime Error

Solution code:
S = input()
l = len(S)

S1 = S[0:(l-1)//2]
S2 = S[(l+3)//2]

def Kaibun(Str):
	if Str == Str[::-1]:
		return True
	else:
		return False

if Kaibun(S):
	if Kaibun(S1) and Kaibun(S2):
		print("Yes")
	else:
		print("No")
else: print("No")

Submission status: Runtime Error

Solution code:
S = input()
l = len(S)

S1 = S[0:(l-1)//2]
S2 = S[(l+3)//2]

def Kaibun(Str):
	if Str == Str[::-1]:
		return True
	else:
		return False

if Kaibun(S) and Kaibun(S1) and Kaibun(S2):
	print("Yes")
else:
	print("No")

Submission status: Runtime Error

Solution code:
S = input()
l = len(S)

S1 = S[0:(l-1)//2]
S2 = S[(l+3)//2]

def Kaibun(Str):
	if Str == Str[::-1]:
		return True
	else: return False

if Kaibun(S1) and Kaibun(S2):
	print("Yes")
else: print("No")

Submission status: Runtime Error

Solution code:
def f(x):
  return x==x[::-1]
S=str(input())
N=len(S)
S1=S[:(N-3)/2]
S2=S[(N+1)/2:]
if f(S) and f(S1) and f(S2):
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
def f(x):
  return x==x[::-1]
S=input()
n=(len(S)-1)/2
S1,S2=S[:n-1],S[n+1:]
if f(S) and f(S1) and f(S2):
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def pal(s):
  f = True;
  i = 0;
  l = s.size() - 1;
  while i < l - i:
    if s[i] != s[l - i]:
      f = false;
	i++;
  return f;

s = input();
f = pal(s) and pal(s[0:(n//2 - 1):]) and pal(s[(n//2 + 1)::]);
if f == True:
  print("Yes");
else:
  print("No");

Submission status: Runtime Error

Solution code:
akacaka
S = []
S_reverse = []
S_first = []
S_first_reverse = []
S_last = []
S_last_reverse = []

S = list(input())
S_reverse = S.copy()
S_reverse.reverse()
S_first = S[:len(S)//2]
S_last = S[(len(S)+1)//2:]
S_first_reverse = S_first.copy()
S_first_reverse.reverse()
S_last_reverse = S_last.copy()
S_last_reverse.reverse()


if S != S_reverse:
    print("No")
elif S_first == S_first_reverse and S_last == S_last_reverse:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
 = input()
def isPalindrome(string):
    return s == s[::-1]
if isPalindrome(s) and isPalindrome(s[:len(s)//2]) and isPalindrome(s[len(s)//2+1:]):
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
def palin(S):
{
  K=S
  L=len(S)
  for x in range(L):
    S[L-x-1]=K[x]
  
  if(S==K):
    return true
  else:
    return false
}

  S = input()
  
  pali=palin(S)
  
  if(pali):
    pali=palin(S[0:(len(S)-2)/2])
  else:
    print("No")
  
  if(pali):
    pali = palin(S[(len(S)+3)/2-1:len(S)-1])
  else:
    print("No")
  if(pali):
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

Solution code:
def palin(S)
{
  K=S;
  L=len(S);
  for x in range(L):
    S[L-x-1]=K[x];
  
  if(S==K)
    return true;
  else
    return false;
}

  S = input();

  cin>>S;
  
  pali=palin(S);
  
  if(pali)
    pali=palin(S[0:(len(S)-2)/2]);
  else:
    print("No");
  
  if(pali):
    pali = palin(S[(len(S)+3)/2-1:len(S)-1]);
  else:
    print("No");
  if(pali):
    print("Yes");
  else:
    print("No");
  
  return 0;
}

Submission status: Runtime Error

Solution code:

def palin(S)
{
  K=S;
  L=len(S);
  for x in range(L):
    S[L-x-1]=K[x];
  
  if(S==K)
    return true;
  else
    return false;
}

  S = input();

  cin>>S;
  
  pali=palin(S);
  
  if(pali)
    pali=palin(S[0:(strlen(S)-2)/2]);
  else:
    print("No");
  
  if(pali):
    pali = palin(S[(strlen(S)+3)/2-1:strlen(S)-1]);
  else:
    print("No");
  if(pali):
    print("Yes");
  else:
    print("No");
  
  return 0;
}

Submission status: Runtime Error

Solution code:
s = str(input())
 
def iskaibun(w)	
	l = int(len(w))
	if w[0:(l-1)/2] == w[(l+3)/2-1:l]:
    	return True
  	else:
      	return False
tf = False
if iskaibun(s) is True:
  	t = len(s)
	if iskaibun(s[0:(t-1)/2]) is True and iskaibun(s[(t+3)/2-1:]) is True:
        tf = True
if tf is True:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
s = str(input())
 
def iskaibun(w)	
	l = int(len(w))
	if w[0:(l-1)/2] == w[(l+3)/2-1:l]:
    	return True
  	else:
      	return False
tf = False
if iskaibun(s) is True:
  	t = len(s)
	if iskaibun(s[0:(t-1)/2]) is True and iskaibun(s[(t+3)/2-1]:) is True:
        tf = True
if tf is True:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
s = str(input())

def iskaibun(w)	
	l = int(len(w))
	if w[0:(l-1)/2] == w[(l+3)/2-1:l]:
    	return True
  	else:
      	return False
tf = False
if iskaibun(s) is True:
  	t = len(s)
	if iskaibun(w[0:(t-1)/2]) is True and iskaibun(w[(t+3)/2-1]:) is True:
      tf = True
if tf is True:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
def pal(s):
  x = len(s)
  if s == s[x::-1] & (s[:(x-3)/2] == s[(x-3)/2::-1] & s[(n+1)/2:] == s[-1:(n+1)/2]):
    print("Yes")
   else:
    print("No)

Submission status: Runtime Error

Solution code:
def pal(s):
  x = len(s)
  if s == s[x::-1] & (s[:(x-3)/2] == s[(x-3)/2::-1] & s[(n+1)/2:] == s[-1:(n+1)/2]):
    print("Yes")
   else:
    priint("No)

Submission status: Runtime Error

Solution code:
str1 = input()
n = len(str1)
m = (n-1)/2
o = (n+3)/2
str2 = str1[:m]
str3 = str1[o:n]
if str1 != str1[::-1]:
	print("No")
else:
  	if str2 != str2[::-1]:
    	print("No")
    else:
    	if str3 != str3[::-1]:
        	print("No")
        else:
        	print("Yes")

Submission status: Runtime Error

Solution code:
s = list(input())
N = len(s)
c=0
for i in range(N-1):
  if s[i] != s[N-1-i]:
    c+=1

for i in range(N-1):
  if s[i] != s[(N-1)/2-1-i]:
    c+=1
    
for i in range(N-1):
  if s[(N+3)/2-1+i] != s[N-1-i]:
    c+=1

if c == 0:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
s = input()
N = len(s)
c=0
for i in range(N-1):
  if s[i]==s[N-1-i] and s[i]==s[(N-1)/2-1-i] and s[(N+3)/2-1+i]==s[N-1-i]:
    c+=1
    
if c == N:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
s = list(input())
N = len(s)
c=0
for i in range(N-1):
  if s[i]==s[N-1-i] and s[i]==s[(N-1)/2-1-i] and s[(N+3)/2-1+i]==s[N-1-i]:
    c+=1
    
if c == N:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
s = list(input())
N = len(s)
c=0
for i in range(N-1):
  if s[i]=s[N-1-i] and s[i]=s[(N-1)/2-1-i] and s[(N+3)/2-1+i]=s[N-1-i]:
    c+=1
    
if c == N:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
s = list(input())
N = len(s)
for i in range(N-1):
  if s[i]=s[N-1-i] and s[i]=s[(N-1)/2-1-i] and s[(N+3)/2-1+i]=s[N-1-i]:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

Solution code:
a = input()
for i in range(len(a) // 2):
    if a[i] != b[-(i+1)]:
        print("No")
        exit()
b = a[0:(len(a) - 1) // 2]
c = a[(len(a) + 3) // 2 - 1:len(a)]
for i in range(len(b) // 2):
    if b[i] != b[-(i+1)]:
        print("No")
        exit()
for i in range(len(c) // 2):
    if c[i] != c[-(i+1)]:
        print("No")
        exit()
print("Yes")

Submission status: Runtime Error

Solution code:
S = input()
N = len(S)
S_list = list(S)
for n in range(N):
    if S_list[n] != S_list[N-n-1]:
        kaibun = False
        break
    kaibun = True
        
if kaibun == True:
    for n in range(int((N-1)/2)):
        if S_list[n] != S_list[int(((N-1)/2)-n-1)]:
            cho_kaibun = False
            break
        cho_kaibun = True

if cho_kaibun == True:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
S = input()
N = len(S)
S_list = list(S)
for n in range(N):
    if S_list[n] != S_list[N-n-1]:
        kaibun = False
        break
    kaibun = True
        
if kaibun == True:
    for n in range(int((N-1)/2)):
        if S_list[n] != S_list[int(((N-1)/2)-n-1)]:
            cho_kaibun = False
            break
        cho_kaibun = True

if cho_kaibun == True:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
S = input()
sl = list(S)
N = len(sl)
flag = 0
a = int((N-1)/2)
b = int((N+3)/2)
slr = list(reversed(sl))
asl = sl[0:a]
aslr = list(reversed(asl))
bsl = sl[b:N]
bslr = list(reversed(bsl))
for i in range(N-1):
  if sl[i] != slr[i]:
    flag += 1
for i in range(0,a-1):
  if asl[i] != aslr[i]:
    flag += 1
for i in range(b-1,N-3):
  if bsl[i] != bslr[i]:
    flag += 1
if flag == 0:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
S = input()
N = len(S)
flag = 0
a = (N-1)/2
b = (N+3)/2
sl = list(S)
slr = reversed(sl)
asl = sl[0:a]
aslr = reversed(asl)
bsl = sl[b:N]
bslr = reversed(bsl)
for i in range(N):
  if sl[i] != slr[i]:
    flag += 1
for i in range(0,a-1):
  if asl[i] != aslr[i]:
    flag += 1
for i in range(b-1,N):
  if bsl[i] != bslr[i]:
    flag += 1
if flag == 0:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
str = input()
N = len(str)

ans = 0

if str == str[::-1]:
  str1 = str[:(N-1)/2]
  if str1 == str1[::-1]:
    str2 = str[(N+1)/2:]
    if str2 == str2[::-1]:
      ans = 1

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

Submission status: Runtime Error

Solution code:
str = input()
N = len(str)

if str == str[::-1]:
  str1 = str[:(N-1)/2]
  if str1 == str1[::-1]:
    str2 = str[(N+1)/2:]
    if str2 == str2[::-1]:
      print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
x = int(input())
a = x//500
b = (x-500*a)//5
print(int(1000*a + 5*b))

Submission status: Runtime Error

Solution code:
str = input()
N = len(str)

str_rev = ''.join(list(reversed(str)))

if str == str_rev:
  str1 = str[:(N-1)/2]
  str1_rev = ''.join(list(reversed(str1)))
  if str1 == str1_rev:
    str2 = str[(N+1)/2:]
    str2_rev = ''.join(list(reversed(str2)))
    if str2 == str2_rev:
      print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
str = input()
N = len(str)

str_rev = ''.join(list(reversed(str)))

if str == str_rev:
  str1 = str[:(N-1)/2]
  str1_rev = ''.join(list(reversed(str1)))
  if str1 == str1_rev:
    str2 = str[(N+3)/2:]
    str2_rev = ''.join(list(reversed(str2)))
    if str2 == str2_rev:
      print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
s = input()
end = (len(s)-1)//2
start = (len(s)+3)//2
if s[0:end] == s[end-1::-1]:
    if s[start-1::] == s[-1:start-2:-1]:
        if s[0::] == s[::-1]
            print("Yes")
        else:
            print("No")
    else:
        print("No")
else:
    print("No")

Submission status: Runtime Error

Solution code:
s=str(input())
def isPalin(l,r):
  if l >= r:
    return True
  if s[l]!=s[r]:
    return False:
  return isPalin(l+1,r-1)
n = len(s)
if isPalin(0,n-1) and isPalin(0,n//2-1) and isPalin(n//2+1,n-1):
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
def Palindrome(S):
    if len(S)==1:
        return "Yes"
    for i in range(int((len(S)-1)/2)):
        if S[i]==S[len(S)-i-1]:
            YorN="Yes"
        else:
            YorN="No"
            break
    return YorN
S = input()
Sl = list(S)
left = right = "No"
if Palindrome(Sl) == "Yes":
    middle=int((len(Sl)-1)/2)
    print(Sl[:middle],Sl[middle+1:])
    left  = Palindrome(Sl[:middle])
    right = Palindrome(Sl[middle+1:])
if left == "Yes" and right == "Yes":
    YorN = "Yes"
else:
    YorN = "No"
print(YorN)

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
def Palindrome(S):
    if int(len(S)/2)==int((len(S)+1)/2):
        return "No"
    for i in range(int(len(S)/2)):
        if S[i]==S[len(S)-i-1]:
            YorN="Yes"
        else:
            YorN="No"
            break
    return YorN
S = input()
Sl = list(S)
left = right = "No"
if Palindrome(Sl) == "Yes":
    middle=int(len(Sl)/2)
    left  = Palindrome(Sl[:middle])
    right = Palindrome(Sl[middle+1:])
if left == "Yes" and right == "Yes":
    YorN = "Yes"
else:
    YorN = "No"
print(YorN)

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
def Palindrome(S):
    for i in range(int(len(S)/2)):
        if S[i]==S[len(S)-i-1]:
            YorN="Yes"
        else:
            YorN="No"
            break
    return YorN
S = input()
Sl = list(S)
left = right = "No"
if Palindrome(Sl) == "Yes":
    middle=int(len(Sl)/2)
    left  = Palindrome(Sl[:middle])
    right = Palindrome(Sl[middle+1:])
if left == "Yes" and right == "Yes":
    YorN = "Yes"
else:
    YorN = "No"
print(YorN)

Submission status: Runtime Error

Solution code:
s = input()
n = s.size()
ans=""
 
half = s[0:(n-1)/2]
 
if s==s[::-1] and half==half[::-1]:
	ans = "Yes"
else:
	ans = "No"
  
print(ans)

Submission status: Runtime Error

Solution code:
s = input()
n = s.size()
ans=""
 
half = s[0:(n-1)/2]
 
if(s==s[::-1] && half==half[::-1]){
	ans = "Yes";
}
else
	ans = "No";
  
print(ans)
}

Submission status: Runtime Error

Solution code:
def kaibun(mojiretu):
    leg = len(mojiretu)
    mid = (leg-1) /2
    for i in range(mid):
        if mojiretu[i] != mojiretu[(mid+1)+i]:
            return False
    return True

input_line = input()
if not kaibun(input_line):
    print('No')
    quit()

mid = (leg-1) /2
if not kaibun(input_line[0:mid]):
    print('No')
    quit()

if not kaibun(input_line[mid+1:]):
    print('No')
    quit()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

s = input()
n = len(s)
return isPalindrome(s) and isPalindrome(s[:n//2+1]) and isPalindrome(s[n//2+2:])

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
s = input()
def is_pal(x):
  return x == x[::-1]
if is_pal(s) and is_pal(s[:((n-1)/2)]) and is_pal(s[(((n+3)/2)-1):]):
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
s = input()
n = len(a)
a = s[:(n-1)//2:]
b = [(n+3)//2::]

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

Submission status: Runtime Error

Solution code:
s = input()
n = len(a)
a = s[:(n-1)/2:]
b = [(n+3)/2::]

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