Problem:


Score : 200 points

Problem Statement

Takahashi loves palindromes. Non-palindromic strings are unacceptable to him. Each time he hugs a string, he can change one of its characters to any character of his choice.

Given is a string S. Find the minimum number of hugs needed to make S palindromic.

Constraints

S is a string consisting of lowercase English letters.

The length of S is between 1 and 100 (inclusive).

Input

Input is given from Standard Input in the following format:

S

Output

Print the minimum number of hugs needed to make S palindromic.

Sample Input 1

redcoder

Sample Output 1

1

For example, we can change the fourth character to o and get a palindrome redooder.

Sample Input 2

vvvvvv

Sample Output 2

0

We might need no hugs at all.

Sample Input 3

abcdabc

Sample Output 3

2



Sample input:
redcoder


Sample output:
1

Submission status: Runtime Error

Solution code:
a=input()
bef,aft = a[:int(len(a)/2)], a[-int(len(a)/2):]
cnt = 0
for i,m in enumerate(aft):
  if m != bef[-i]:
    cnt+=1
print(cnt)

Submission status: Runtime Error

Solution code:
a=input()
bef,aft = a[:int(len(a)/2)], a[-int(len(a)/2):]
cnt = 0
for i,m in enumerate(aft):
  if m != bef[i]:
    cnt+=1
print(cnt)

Submission status: Runtime Error

Solution code:
s = list(input())

length = len(s)

print(s)
for i in range(len(s)//2):
    if s[i] != s[-i-1]:
        ans += 1

print(ans)

Submission status: Runtime Error

Solution code:
s = list(input())
s_re = s[::-1]
ans =0
for i in range(s//2):
    if s[i] != s_re[i]:
        ans += 1
print(ans)

Submission status: Runtime Error

Solution code:
str = input()

count = 0
for i in range(int(len(str))):
	if str[i] != str[-1-i]:
    	count += 1
print(count)

Submission status: Runtime Error

Solution code:
s = input()
res = 0
for i in range(len(s)//2):
	if s[i] != s[len(s)-1-i]:
    	res += 1
print(res)

Submission status: Runtime Error

Solution code:
s = input()
res = 0
for i in range(len(s)//2):
	if s[i] != s[len(s)-1-i]:
        res += 1
print(res)

Submission status: Runtime Error

Solution code:
word = input()
wordArray = list(word)
#print(wordArray)
lent = len(wordArray)
iterV=(int)(lent/2)
#print(iterV)

num=0

for i in range(iterV):
    #print("Word at:",i,wordArray[i])
    #print("Word at:",lent-1,wordArray[lent-1])
    if(wordArray[i] == wordArray[lent-1]):
       #print(" if Num:",num)
    else:      
       print(" else temp:",temp)
       wordArray[i]=wordArray[lent-1]      
       print("else Word at post swap:",i,wordArray[i])
       #print("else Word at post swap:",lent-1,wordArray[lent-1])
       num=num+1       
   
lent=lent-1
#print(" else Num:",num)
#print(" else lent:",lent)

print(num)

Submission status: Runtime Error

Solution code:
a = input()
b = 0
C = -1
d = 0

for i in range(len(a)):
	if a[b] != a[c]:
      d = d + 1
    b = b + 1
    C = c - 1

print(d/2)

Submission status: Runtime Error

Solution code:
s=str(input())
hug=0

#偶数の時
if len(s)%2==0:
  down_number=len(s)/2
  up_number=len(s)/2+1

#奇数の時        
else:
  centor_number=len(s)/2+0.5
  up_number=centor_number-1
  down_number=centor_number+1
  
#下限が0になるまで繰り返す  
while not down_number==0:
  if not str(s[down_number]) == str(s[up_number]):
      hug+=1
      down_number-=1
      up_number+=1
  else:
      down_number-=1
      up_number+=1

print(hug)

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
import sys
import Levenshtein

a=input()
a_half=a[:len(a)//2:]
a_half_int=a[-(-len(a)//2)::]
a_half_int=a_half_int[::-1]

ans=Levenshtein.distance(a_half,a_half_int)
print(ans)

Submission status: Runtime Error

Solution code:
count = -1
realcount = 0
for i in k:
    count +=1
    if i!=S[count]:
        S.replace(S[count],i)
        realcount+=1
        if realcount == 0:
            real = 0
        else:
            real = realcount//2
print(real)

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-

s = input()
s_list = list(s)
s_len = len(s_list)

hag = 0

for i in range(s_len//2):
  if s_list[i] != s_list[(s_len-1)-i]:
    s_list[s_len-i] = s_list[i]
    hag += 1
  
print(hag)

Submission status: Runtime Error

Solution code:
S = input()
k = S[::-1]
count = -1
realcount = 0
for i in k:
    count +=1
    if i!=S[count]:
        S.replace(S[count],i)
        realcount+=1
        real = realcount//2
print(real)

Submission status: Runtime Error

Solution code:
S = input()
lis = list(S)
lis_rev = list(S)
lis_rev.reverse()
cnt = 0

lgh = 

for i in range(len(lis) // 2):
    if lis[i] != lis_rev[i]:
        cnt += 1
print(cnt)

Submission status: Runtime Error

Solution code:
s = input()
p = len(s)
q = p-1
qq = q%2
ss = list(s)
r=0
if qq == 1:
    for i in range(0,q+1/2):
        if ss[i] != ss[q-i]:
            ss[i] = ss[q-i]
            r= r+1

elif qq == 0:
    for i in range(0,q//2):
        if ss[i] != ss[q-i]:
            ss[i] = ss[q-i]
            r = r+1

print(r)

Submission status: Runtime Error

Solution code:
s = input()
p = len(s)
q = p-1
qq = q%2
ss = list(s)
r=0
print(ss)
if qq == 1:
    for i in range(0,q+1/2):
        if ss[i] != ss[q-i]:
            ss[i] = ss[q-i]
            r= r+1

elif qq == 0:
    for i in range(0,q//2):
        if ss[i] != ss[q-i]:
            ss[i] = ss[q-i]
            r = r+1

print(r)

Submission status: Runtime Error

Solution code:
s=input()
cnt=0

if len(s)%2==0:
  for i in range(len(s)/2):
    if s[i]!=s[len(s)-1-i]:
      cnt+=1
      
else:
  for i in range((len(s)+1)/2):
    if s[i]!=s[len(s)-1-i]:
      cnt+=1
print(cnt)

Submission status: Runtime Error

Solution code:
s=input()
cnt=0

if len(s)%2==0:
  for i in range(len(s)/2):
    if s[i]!=s[len(s)-i]:
      cnt+=1
else:
  for i in range((len(s)+1)/2):
    if s[i]!=s[len(s)-i]:
      cnt+=1
print(cnt)

Submission status: Runtime Error

Solution code:
s=input()
cnt=0
if len(s)%2==0:
  for i in range(len(s)//2):
    if s[i]!=s[len(s)-i]:
      cnt+=1
else:
  for i in range((len(s)+1)//2):
    if s[i]!=s[len(s)-i]:
      cnt+=1
print(cnt)

Submission status: Runtime Error

Solution code:
s = input()

l = len(s)
sen = l // 2
c = 0

for i in range(sen):
  s1 = s[i]
  s2 = s[l-i]
  
  if s1 != s2:
    c += 1
print(c)

Submission status: Runtime Error

Solution code:
r = 0
s = input()
for n in len(s):
  k = (-1)*(n+1)
  if s[n] != s[k]:
    r += 1
print(r/2)

Submission status: Runtime Error

Solution code:
r = 0
s = input()
for n in len(s):
  if s[n] != s[(-1)*(n+1)]:
    r = r+1
print(r/2)

Submission status: Runtime Error

Solution code:
r=0
s=input()
for n in len(s):
  if s[n] != s[(-1)*(n+1)]:
    r+=1
print(r/2)

Submission status: Runtime Error

Solution code:
r=0
s=input()
for n in len(s):
  if s[n]!=s[-(n+1)]:
    r+=1
print(r/2)

Submission status: Runtime Error

Solution code:
r=0
s=input()
for n in len(s):
  if s[n]!=s[-n]:
    r+=1
print(r/2)

Submission status: Runtime Error

Solution code:
s = (int(x) for x in input().split())
p = [0:len(s)/2]
s = [len(s)/2:len(s)+1]
hug = 0
s.reverse()
for i in s:
  for m in p:
    if i!=m:
      hug+=1
      
print(hug)

Submission status: Runtime Error

Solution code:
S = intput()
n = len(S)
count = 0
for i in range(n // 2):
    if S[i] != S[n - 1 - i]:
        count += 1
print(count)

Submission status: Runtime Error

Solution code:
S = input()
print(S)
print(S[2])

count = 0
for i in range(int(len(S)/2)):
    if S[i] != S[len(S)-i-1]:
        count += 1

print(count)

Submission status: Runtime Error

Solution code:
S = input()
count=0
if len(S)%2==0:
  for i,s in inumerate(S):
    if S[len(S)-i-1]!=s:
      count+=1
    if i>=len(S)//2:
      break
else:
  for i,s in inumerate(S):
    if S[len(S)-i-1]!=s:
      count+=1
    if i==len(S)//2:
      break
print(count)

Submission status: Runtime Error

Solution code:
s = input()

n = len(str)

ans = 0
for i in range(int(n/2)):
  if s[i] != s[n-i-1]:
    ans += 1
    
print(ans)

Submission status: Runtime Error

Solution code:
#lang:reverse.py

result = 0
str = input()
#文字数
str_length = len(str)
rev_str = str[::-1]
count = 0

if str_length % 2 == 1:
    count = (str_length -1)/2
else:
    count = str_length / 2


for i in range(count):
    if str[i] != rev_str[i] :
        result = result + 1

print(result)

Submission status: Runtime Error

Solution code:
lang:reverse.py
result = 0
str = input()
--文字数
str_length = len(str)
rev_str = str[::-1]
count = 0

if str_length % 2 == 1:
    count = (str_length -1)/2
else:
    count = str_length / 2


for i in range(count):
    if str[i] != rev_str[i] :
        result = result + 1

print(result)

Submission status: Runtime Error

Solution code:

import sys
import math
def resolve():
    S=input().rstrip()
    c=0
    for i in range((len(S)/2)):
        if(S[i]!=S[-i-1]):
            c+=1
    print(c)

from io import StringIO
import unittest

class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """redcoder"""
        output = """1"""
        self.assertIO(input, output)
    def test_入力例_2(self):
        input = """vvvvvv"""
        output = """0"""
        self.assertIO(input, output)
    def test_入力例_3(self):
        input = """abcdabc"""
        output = """2"""
        self.assertIO(input, output)

if __name__ == "__main__":
    #unittest.main()
    resolve()

Submission status: Runtime Error

Solution code:
n=int(input())
w = list(map(int,input().split()))
sum_w=sum(w)
sum_a=0
sa=[]
for i in range(n):
    sum_a += w[i]
    sa.append(abs(sum_w - sum_a * 2))
print(min(sa))

Submission status: Runtime Error

Solution code:
s=input()
l=len(s)
n=l//2
count=0
for num in range(n):
  if(s[num]==s[l-num-]):
    pass
  else:
    count+=1
print(count)

Submission status: Runtime Error

Solution code:
s = input()

x = len(s)

a = 0

if x%2 == 0:
  for y in range(x/2):
    if s[y] != s[x-y-1]:
      a += 1
      
if x%2 == 1:
  for z in range((x-1)/2):
    if s[z] != s[x-z-1]:
      a += 1
      
print(a)

Submission status: Runtime Error

Solution code:
s = input()

x = len(s)

a = 0

if x%2 == 0:
  for y in range(x/2):
    if s[y] != s[x-y-1]:
      a = a + 1
      
if x%2 == 1:
  for z in range((x-1)/2):
    if s[z] != s[x-z-1]:
      a = a + 1
      
print(a)

Submission status: Runtime Error

Solution code:
s = input()

x = len(s)

a = 0

if x%2 == 0:
  for y in range(x/2):
    if s[y] != s[x-y-1]:
      a = a + 1
      
if x%2 == 1:
  for z in range((x-1)/2):
    if s[z] != s[x-z-1]:
      a = a + 1

Submission status: Runtime Error

Solution code:
s = input()

x = len(s)

a = 0

if x%2 == 0:
  for y in range(x/2):
    if s[y] != s[x-1]:
      a = a + 1
      
if x%2 == 1:
  for z in range((x-1)/2):
    if s[z] != s[x-1]:
      a = a + 1

Submission status: Runtime Error

Solution code:
s = input()

x = len(s)

a = 0

if x%2 == 0:
  for y in range(x/2):
    if s[y] == s[x-1]:
      a = a + 1
      
if x%2 == 1:
  for z in range((x-1)/2):
    if s[z] == s[x-1]:
      a = a + 1

Submission status: Runtime Error

Solution code:
s = input()

x = len(s)

a = 0

if x%2 == 0:
  for y in range(x/2):
    if s[y] == s[x-1]:
      a = a + 1
      
if x%2 == 1:
  for z in range((x-1)/2):
    if s[y] == s[x-1]:
      a = a + 1

Submission status: Runtime Error

Solution code:
s = input()

x = len(s)

a = 0

if x%2 == 0:
  for y in range(x/2):
    if s[y] == s[x-1]:
      a = a + 1
      
if x%s == 1:
  for z in range((x-1)/2):
    if s[y] == s[x-1]:
      a = a + 1

Submission status: Runtime Error

Solution code:
s = input()

x = len(s)

a = 0

if x%2 == 0:
  for y in range(x/2):
    if s[y-1] == s[x-1]:
      a = a + 1
      
if x%s == 1:
  for z in range((x-1)/2):
    if s[y-1] == s[x-1]:
      a = a + 1

Submission status: Runtime Error

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

count=0
for i in range(len(S)//2):
  if S[i]!=S[-(i+1)]:
    count = cunt+1

print(count)

Submission status: Runtime Error

Solution code:
import sys
import functools
import operator

def main():
   s = sys.stdin.readline().rstrip()
   h = int(len(s) / 2)
   n = functools.reduce(operator.add, map(lambda x: 0 if(s[x] == s[-1-x]) else 1, range(0, h)))
   print(n)

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
import sys
s = input()
n = 0
l = len(s)
for i in range(l):
  j = l-i-1
  if i>=j:
    print(n)
    return
  if s[i]!=s[j]:
    n = n+1
print(n)
return

Submission status: Runtime Error

Solution code:
S = list(input())

count = 0

for i in range(len(S)//2):
  if S[i]!=S[-(i+1)]
  	count = count + 1
   
  
print(count)

Submission status: Runtime Error

Solution code:
S = input()
ans = 0
N = len(S)
for i in range(N):
    if S[i] != S[N-1-i]:
        ans += 1
print(cnt//2)

Submission status: Runtime Error

Solution code:
import numpy as np

S=input()

print(sum(np.array(list(S[int(len(S)/2)+1:]))!=np.array(list(S[:int(len(S)/2)][::-1]))))

Submission status: Runtime Error

Solution code:
a=input()
res = 0
i = 0
j = len(a)-1
while(i!=j):
  if(a[i]==a[j]):
    i=i+1
    j=j-1
  else:
    i=i+1
    j=j-1
    res=res+1
print(res)

Submission status: Runtime Error

Solution code:
s=input()
ans=0
for i in range(len(s)//2)-1:
	if s[i]!=s[len(s)-1-i]:
		ans+=1
print(ans)

Submission status: Runtime Error

Solution code:
s = input()
kk = len(s)
k = k//2
ans = 0
for i in range(k):
  if s[i] != s[kk - i - 1]:
    ans += 1
print(ans)

Submission status: Runtime Error

Solution code:
import numpy as np

S=input()

print(sum(np.array(list(S[int(len(S)/2):]))!=np.array(list(S[:int(len(S)/2)][::-1]))))

Submission status: Runtime Error

Solution code:
s = input()
c = 0
n = len(s)
print(n)
if n%2 == 0:  
	for i in range(n/2):
		if s[i]!=s[-(i+1)]:
			c = c + 1
else:
    for i in range(int((n+1)/2)):
        if s[i]!=s[-(i+1)]:
            c = c + 1
print(c)

Submission status: Runtime Error

Solution code:
s = input()
c = 0
n = len(s)
if n%2 == 0:  
	for i in range(n/2):
      if s[i]==s[-i]:
        c += 1
else:
  	for i in range((n-1)/2):
      if s[i]==s[-i]:
        c += 1
print(c)

Submission status: Runtime Error

Solution code:
S = input()
l = len(S)
c = 0
for i in range(l // 2):
  if S[i] == S[l-i]:
    pass
  else:
    c +=1
print(c)

Submission status: Runtime Error

Solution code:
S = input()
l = len(S)
c = 0
for i in range(l // 2):
  if S[i] == S[l-i]:
    c +=1
print(c)

Submission status: Runtime Error

Solution code:
text = input()
n = len(text)
ans = 0
if int(n/2) == n/2:
  for i in range(int(n/2)):
    if text[i] !=text[n-i-1]:
      ans = ans + 1
else:
  for i in range((n-1)/2):
    if text[i] !=text[n-i-1]:
      ans = ans + 1   
input(int(ans))

Submission status: Runtime Error

Solution code:
S = input()
count = 0
for i in range(int(len(S)/2)):
  if S[i] != S[len(S)-i]:
    count += 1
print(count)

Submission status: Runtime Error

Solution code:
s = input()
l = len(s)
h = l // 2
lis1 = []
lis2 = []
for i in range(0, l + 1):
  lis1.append(s[i])
  lis2.append(s[-(i + 1)])
count = 0
for a, b in zip(lis1, lis2):
  if a != b:
    count += 1
print(count)

Submission status: Runtime Error

Solution code:
s = input()
n = len(s)
cost = 0
for i in range(n // 2):
    cost += (s[i] != s[n - i])
print(cost)

Submission status: Runtime Error

Solution code:
s = input()
l = (len(s) - len(s) % 2) / 2

for i in range(l):
  if s[i] != s[len(s) - i]:
    count += 1

print(count)

Submission status: Runtime Error

Solution code:
s = input()
ans = 0
for i in range((len(s)-1)//2+1):
  if a[i] != a[-1-i]:
    ans += 1
print(ans)

Submission status: Runtime Error

Solution code:
S=input()
slen = len(S)
slen2 = slen // 2
ans=0
for i in range slen2:
  if S[i] != S[-i]:
    ans += 1
print(ans)

Submission status: Runtime Error

Solution code:
S = input()
ans = 0
if len(S) % 2 == 0:
    a = S[:len(S) // 2]
    b = S[len(S) // 2:]

    for i in range(len(a)):
        if a[i] != b[-i - 1]
            ans += 1

else:
    mid = len(S) // 2
    a = S[:mid]
    b = S[mid:]
    for i in range(len(a)):
        if a[i] != b[-i - 1]:
            ans += 1

print(ans)

Submission status: Runtime Error

Solution code:
s=input();l=len(s)//2-1;c=0
if len(s)==1:
  print(0)
else
  for i in range(l):
    if s[i]!=s[-i-1]:
      c+=1
  print(c)

Submission status: Runtime Error

Solution code:
s=input()
count=0
i=0
while i<=range(len(s) // 2):
	if s[i]!=s[-(i+1)]:
		count+=1
    i+=1
print(count)

Submission status: Runtime Error

Solution code:
s=input()
i=0
count=0

while i<range(len(s)//2):
	if s[i]!=s[-(i+1)]:
		count+=1
	i+=1

print(count)

Submission status: Runtime Error

Solution code:
word = list(input())

count = 0  # 入れ替える個数を用意

if len(word) % 2 == 0:  # もしアルファベットの数が偶数の時
	for i in range(0,int(len(word)/2)):
    	if word[i] != word[int(len(word))-1-i]:
        	count += 1    
    print(count)

else:
	for j in range(0,int((len(word)+1)/2-1)):
    	if word[j] != word[int(len(word))-1-j]:
        	count += 1            
    print(count)

Submission status: Runtime Error

Solution code:
word = list(input())

count = 0  # 入れ替える個数を用意

if len(word) % 2 == 0:  # もしアルファベットの数が偶数の時
	for i in range(0,int(len(word)/2)):
    	if word[i] != word[len(word)-1-i]:
        	count += 1    
    print(count)

else:
	for j in range(0,int((len(word)+1)/2-1)):
    	if word[j] != word[len(word)-1-j]:
        	count += 1            
    print(count)

Submission status: Runtime Error

Solution code:
s = input()
ans = 0
for i in range(len(S)//2):
  if S[i] != S[-i-1]:
    ans+=1
print(ans)

Submission status: Runtime Error

Solution code:
str = input()
lst = list(reversed(str))
lst.insert(0," ")
count = 0

for i in lst[1:]:
  if lst[i] != lst[-i]:
    count += 1
  else:
    pass
print(count)

Submission status: Runtime Error

Solution code:
a=input()
n=len(a)
if n%2==0:
    a1=a[:n//2]
    a2=a[n//2:]
else:
    a1=a[:n//2]
    a2=a[(n//2)+1:]
cnt=0
for x,i in enumerate(a1):
    if i!=a2[-x+1]:
        cnt+=1
print(cnt)

Submission status: Runtime Error

Solution code:
S=int(input())
num=0
for i in range(len(S)//2):
  if S[i]!=S[-i]:
    num+=1
print(num)

Submission status: Runtime Error

Solution code:
s=input()
n=len(s)
les = 0
for i in range(n):
  if s[i] != s[n - i - 1]:
    les++;
print(les / 2)

Submission status: Runtime Error

Solution code:
S=input()
ans=0
for i in range(len(S)//2):
  ans+=(S[i]!=S[-1-i]
print(ans)

Submission status: Runtime Error

Solution code:
S = input()

def kaibun(string):
    count = 0
    strli = list(string)
    for i in range(len(string)/2):
        if strli[i] == strli [-i-1]:
            continue
        else:
            count += 1
    return count

print(kaibun(S))

Submission status: Runtime Error

Solution code:
str = input
count = 0

for i in range(len(str)):
  if str[i] != str[len(str)-1-1]:
    count += 1
    
print(count/2)

Submission status: Runtime Error

Solution code:
S = input()

c = 0
for a, b in zip(s, s[-1]):
  if a == b:
    c += 1

print(len(S)-c)

Submission status: Runtime Error

Solution code:
input(a,b)
print(a,b)

Submission status: Runtime Error

Solution code:
bun = inputs[0]
nub = list(reversed(bun))
n = int(len(bun) / 2)

i = hug = 0
while i < n:
    if bun[i] != nub[i]:
        hug += 1
    i += 1
print(hug)

Submission status: Runtime Error

Solution code:
bun = input()
nub = reversed(S)
n = int(len(S) / 2)

i = hug = 0
while i < n:
    if bun[i] != nub[i]:
        hug += 1
    i += 1
print(hug)

Submission status: Runtime Error

Solution code:
S=input()
a=0
for i in range(len(S)//2):
  while S[i]!=S[len(S)-i]:
    a=a+1
print(a)

Submission status: Runtime Error

Solution code:
S = list(map(int,input().split()))
p=len(S)
t=0
for n in range(p):
  if S[n]!=S[p-n-1]:
    t+=1
print(t/2)

Submission status: Runtime Error

Solution code:
S = input()
len(S)=p
t=0
for n in range(p):
  if S[n]!=S[p-n-1]:
    t+=1
print(t/2)

Submission status: Runtime Error

Solution code:
S = list(map(int,input().split()))
len(S)=p
t=0
for n in range(p):
  if S[n]!=S[p-n-1]:
    t+=1
print(t/2)

Submission status: Runtime Error

Solution code:
S = list(map(int,input().split()))
len(S)=p
t=0
for n in range(p):
  if S[n]=S[p-n-1]:
    continue
  else:
    t+=1
print(t/2)

Submission status: Runtime Error

Solution code:
S = input()
len(S)=p
t=0
for n in range(p):
  if S[n]=S[p-n-1]:
    continue
  else:
    t+=1
print(t/2)

Submission status: Runtime Error

Solution code:
S = input()
len(S)=p
t=0
for n in range(p):
  if S[n]=S[p-n-1]:
    continue
  else:
    t+=1
print(t)

Submission status: Runtime Error

Solution code:
S = list(map(int,input().split()))
len(S)=int(p)
t=0
for n in range(p):
  if S[n]=S[p-n-1]:
    continue
  else:
    t+=1
print(t)

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input().split())
sum = a + b + c
if sum >= 22:
    print('bust')
else:
    print('win')

Submission status: Runtime Error

Solution code:
S = list(map(int,input().split()))
len(S)=p
t=0
for n in range(p):
  if S[n]=S[p-n-1]:
    continue
  else:
    t+=1
print(t)

Submission status: Runtime Error

Solution code:
import random

S = list(input())
n = len(S)
reS = list(reversed(S))

diffeNum_list = []
alphabets = [chr(ord("a") + i) for i in range(26)]
countLi = []

if S == reS:
    print(0)
else:
    for i in range(n):
        if S[i] != reS[i]:
            diffeNum_list.append(i)

    def hantei(S):
        count = 0
        for i in diffeNum_list:
            tempNum = random.choice(alphabets)
            if S[i] != tempNum:
                S[i] = tempNum
                count += 1

            if S == reS:
                countLi.append(count)

    for i in range(10000):
        hantei(S)

    print(min(countLi))

Submission status: Runtime Error

Solution code:
S = input()

a = len(S) / 2
x = 0

if b == 0:
  for i in range(1, int(a+1)):
    if S[i-1]!=S[-i]:
      x += 1
else:
  for i in range(1, int(a+1)):
    if S[i-1]!=S[-i]:
      x += 1

print(x)

Submission status: Runtime Error

Solution code:
s = input()
count = 0
first_half, second_half = s[:len(s)//2], s[(len(s)+1)//2:]
if first_half == reversed(second_half):
    print(count)
else:
    for x in range(len(first_half)):
        if first_half[x] != second_half[len(second_half)-x-1]:
            count += 1
    print(count)

Submission status: Runtime Error

Solution code:
sarray=input()
snum=len(sarray)
if(snum%2==0):
  sn=snum/2
  sfirst=sarray[sn:]
  slatter=sarray[:sn]
else:
  sn=(snum-1)/2
  sfirst=sarray[sn:]
  slatter=sarray[:sn]
slatter.reverse()
result=0
for i in range (sn):
  if(sfirst[i]==slatter[i]):
    continue()
  result+=1
print(result)

Submission status: Runtime Error

Solution code:
# redcoder
string = input()
n = len(string) - 1
if n == 1:
	print(0)
    exit(0)
    
s = 0 
e = n
count = 0
while e > s:
	if string[e] != string[s]:
    	count += 1
    e -= 1
    s += 1

print(count)

Submission status: Runtime Error

Solution code:
S = "redcoder"

ans = 0

ALEN = (len(A))
 
B = list(A)
 
 
 
B_re =  list(reversed(B))
 
ans = 0
 
 
for i in range(ALEN):
    if B[i] != B_re[i]:
        ans = ans+1
    
if ans　% 2 == 0:
    print(ans//2)
elif ans %2 != 0:
    print((ans//2) +1)
elif ans == 0:
    print(0)

Submission status: Runtime Error

Solution code:

a = list(input())
b = len(a)
c = int(b/2)
result = []
if b%2 == 0:
    A = a[:c]
    B = a[c:]
    BB = B[::-1]
    for v in range(c):
        if A[v] != BB[v]:
            result.append(v)
        else:
            x.append(v)
        
else:
    C = a[:c]
    D = a[c+1:]
    DD = D[::-1]
    for v in range(c):
        if C[v] != DD[v]:
            result.append(v)
        else:
            x.append(v)
print(len(result))

Submission status: Runtime Error

Solution code:
words = input()

if len(words)%2 == 0:
    slice_cnt = len(words)//2
    words_cut = [words[:slice_cnt], words[slice_cnt:][::-1]]
    
    set_list = [*map(len, [set([words_cut[0][i], words_cut[1][i]]) for i in range(slice_cnt)])]
    print(set_list.count(2))
    
else:
    slice_cnt = (len(words) -1)//2
    words_cut = [words[:slice_cnt], words[slice_cnt+1:][::-1]]
    
    set_list = [*map(len, [set([words_cut[0][i], words_cut[1][i]]) for i in range(slice_cnt)])]
    print(set_list.count(2))

Submission status: Runtime Error

Solution code:
S=list(input())
count=0
for i in S[]:
  if i!=-i-1:
    count+=1
print(count)

Submission status: Runtime Error

Solution code:
S=list(input())
count=0
for i in S:
  if S[i]!=S[-i-1]:
    count+=1
print(count)

Submission status: Runtime Error

Solution code:
import java.util.*;
public class Main{
  public static void main(String[] args){
    	Scanner s = new Scanner(System.in);
    	String word = s.nextLine();
    	int leng = word.length();
    	String re = word.reverse();
    	int c = 0;
    	for(i=leng-1; i<=0; i--){
          if(word.charAt(i) == re.charAt(i)){
            	continue;
          }else
            c++;
        }
    System.out.println(c/2);
  }
}

Submission status: Runtime Error

Solution code:
sarray=input()
snum=len(s)
if(snum%2==0):
  sn=snum/2
  sfirst=sarray[sn:]
  slatter=sarray[:sn]
else:
  sn=(snum-1)/2
  sfirst=sarray[sn:]
  slatter=sarray[:sn]
slatter.reverse()
result=0
for i in range (sn):
  if(sfirst[i]==slatter[i]):
    continue()
  result+=1
print(result)

Submission status: Runtime Error

Solution code:
s=input()
sarray=s.split("")
snum=len(sarray)
if(snum%2==0):
  sn=snum/2
  sfirst=sarray[sn:]
  slatter=sarray[:sn]
else:
  sn=(snum-1)/2
  sfirst=sarray[sn:]
  slatter=sarray[:sn]
slatter.reverse()
result=0
for i in range (sn):
  if(sfirst[i]==slatter[i]):
    continue()
  result+=1
print(result)

Submission status: Runtime Error

Solution code:
s=input()
sarray=s.split("")
snum=sarray.length()
if(snum%2==0):
  sn=snum/2
  sfirst=sarray[sn:]
  slatter=sarray[:sn]
else:
  sn=(snum-1)/2
  sfirst=sarray[sn:]
  slatter=sarray[:sn]
slatter.reverse()
result=0
for i in range (sn):
  if(sfirst[i]==slatter[i]):
    continue()
  result+=1
print(result)

Submission status: Runtime Error

Solution code:
s=input()
snum = s.length()
sarray=s.split("")
if(snum%2==0):
  sn=snum/2
  sfirst=sarray[sn:]
  slatter=sarray[:sn]
else:
  sn=(snum-1)/2
  sfirst=sarray[sn:]
  slatter=sarray[:sn]
slatter.reverse()
result=0
for i in range (sn):
  if(sfirst[i]==slatter[i]):
    continue()
  result+=1
print(result)

Submission status: Runtime Error

Solution code:
s=input()
snum = s.length()
sarray=s.split("")
if(snum%2==0):
  sn=snum/2
  sfirst=sarray[snum/2:]
  slatter=sarray[:snum/2]
else:
  sn=(snum-1)/2
  sfirst=sarray[(snum-1)/2:]
  slatter=sarray[:(snum-1)/2]
slatter.reverse()
result=0
for i in range (sn):
  if(sfirst[i]==slatter[i]):
    continue()
  result+=1
print(result)

Submission status: Runtime Error

Solution code:
S=input()
count=0
for i in list(S):
  if S[i]!=S[-i-1]:
    count+=1
print(count)

Submission status: Runtime Error

Solution code:
s=input()
count=0
for i in range(len(s)):
  if s[i-1]!=s[len(s)-i]:
    count+=1
  else:
    pass
print(count//2)

Submission status: Runtime Error

Solution code:
S=input()
count=0
for i in S:
  if int(i)!=-int(i-1):
    count+=1
print(count)

Submission status: Runtime Error

Solution code:
s=input()
count=0
for i in range(count(s)):
  if s[i-1]!=s[count(s)-i]:
    count+=1
  else:
    pass
print(count//2)

Submission status: Runtime Error

Solution code:
S = input()
count = 0
first = S[:len(S)//2]
second = S[(len(S)+1)//2:]
if first == reversed(second):
    print(count)
else:
    for i in range(len(first)):
        if first[i] != second[len(second)-i-1]:
            count += 1
    print(count

Submission status: Runtime Error

Solution code:
s=input()
count=0
for i in range(count(s)):
  if s[i-1]==s[count(s)-i]:
    count+=1
  else:
    pass
print(count//2)

Submission status: Runtime Error

Solution code:
S=input()
count=0
for i in S:
  if i!=-i-1:
    count+=1
print(count)

Submission status: Runtime Error

Solution code:
s=input()
count=0
for i in range(count(s)):
  if s[i-1]==s[count(s)-i]:
    count+=1
  else:
    pass
print(count)

Submission status: Runtime Error

Solution code:
str1 = input()
str2 = list(str1)
n = (int(len(str1)/2))
count = 0
for i in range(1, n+1):
    if(str2[i-1]!=str2[-1*i]):
    count = count+1        
print(count)

Submission status: Runtime Error

Solution code:
A = list(input())
B = round(len(A) / 2)
A.pop(B - 1)
R = 0
C = A[0:B-1]
D = A[-(B - 1):]
D.sort(reverse=True)
count = 0
for i in range(B - 1):
	if C[count] != D[count]:
	R += 1
	count += 1
print(str(R))

Submission status: Runtime Error

Solution code:
S=input()
count=0
for i in S:
  if S[i]!=S[0-i-1]:
    count+=1
print(count)

Submission status: Runtime Error

Solution code:
s=input()
count=0
for i in range(count(s)):
  s[i-1]==s[count(s)-i]
  count+=1
print(count)

Submission status: Runtime Error

Solution code:
S = str(input())

half = len(S) // 2

front = list(S[0:half-1])
back = list(S[:half:-1])

count = 0


for i in range(half):
    if front[i-1] == back[i-1]:
        count += 0
    else:
        count += 1
        
print(count)

Submission status: Runtime Error

Solution code:
n=len(S)
ans=0
for i in range(n//2):
    if S[i]!=S[n-i-1]:
        ans+=1
print(ans)

Submission status: Runtime Error

Solution code:
S=input()
count=0
for i in S[]:
  if S[i]!=S[-i-1]:
    count+=1
print(count)

Submission status: Runtime Error

Solution code:
a = input()
a = list(a)
b = len(a)
c = b / 2
d = []
for i in range(0,c):
    d.append(a[i])
e = a[::-1]
f = []
for g in range(0,c):
    f.append(e[g])
answer = 0
for h in range(0,c):
    if d[h] != f[h]:
        answer += 1
print(answer)

Submission status: Runtime Error

Solution code:
S=input()
count=0
for i in S:
  if S[i]!=S[-i-1]:
    count+=1
print(count)

Submission status: Runtime Error

Solution code:
S = input()

num = len(S)

bra = ""
ket = ""
if (num == 1):
    print(0)
else:
    if (num % 2 == 0):
        bra = S[0:int(num/2)]
        ket = S[num:int(num/2) - 1:-1]
    else:
        bra = S[0:int(num/2)]
        ket = S[num:int(num/2) - 2:-1]

    count = 0
    for i in range(int(num/2)):
        if (bra[i] != ket[i]):
            count += 1

    print(count)

Submission status: Runtime Error

Solution code:
S = input()

num = len(S)

bra = ""
ket = ""
if (num % 2 == 0):
    bra = S[0:int(num/2)]
    ket = S[num:int(num/2) - 1:-1]
else:
    bra = S[0:int(num/2)]
    ket = S[num:int(num/2) - 2:-1]

count = 0
for i in range(int(num/2)):
    if (bra[i] != ket[i]):
        count += 1

print(count)

Submission status: Runtime Error

Solution code:
S=list(input())
count=0
for i in S:
  if S[i]!=S[-i-1]:
    count+=1
print(count)

Submission status: Runtime Error

Solution code:
s = input()
c = 0
first, second = s[:len(s)//2], s[(len(s)+1)//2:]
if first == reversed(second):
    print(c)
else:
    for x in range(len(first)):
        if first[x] != second[len(second)-x-1]:
            count += 1
    print(c)

Submission status: Runtime Error

Solution code:
s = input()
c = 0
first, second = s[:len(s)//2], s[(len(s)+1)//2:]
if f == reversed(second):
    print(c)
else:
    for x in range(len(first)):
        if first[x] != second[len(second)-x-1]:
            count += 1
    print(c)

Submission status: Runtime Error

Solution code:
S=int(input())

count = 0

l=[]

l = list(S)

a = len(l)

b = a - 1

for i in range(a):
    if l[i] != l[b-i]:
        count = count + 1

count = count/2

print(int(count))

Submission status: Runtime Error

Solution code:
S=input()
n=0
if len(S)%2==0:
    for i in range (0,int(len(S))/2):
        if S[i]!=S[-i-1]:
            n+=1
else:
    for i in range (0,int(((len(S))+1)/2)):
        if S[i]!=S[-i-1]:
            n+=1
print(n)

Submission status: Runtime Error

Solution code:
a = input()
b = 0
for c, (i, j) in enumerate(zip(a, a[::-1])):
	if i != j:
    	b += 1

print(b//2 + b%2)