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

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

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

Solution (Python):
a = input()
n = len(a)
ar = []
br = []
for i in range(n//2):
    ar.append(a[i])
for i in range(n-1,n//2-1,-1):
    br.append(a[i])
count = 0
for i in range(n//2):
    if ar[i] != br[i]:
        count += 1
print(count)

Solution (Python):
S = input()

size = len(S)
ans = 0

for i in range(size // 2):
    if S[i] != S[size - i - 1]:
        ans += 1

print(ans)

Solution (Python):
import math

input_str = str(input())
cnt = 0

for i in range(math.floor(len(input_str) / 2)):
  if input_str[i] != input_str[len(input_str) - i - 1]:
    cnt += 1

print(cnt)

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

Solution (Python):

import sys

a=input()
a_half=a[:len(a)//2:]
a_half_int=a[-(-len(a)//2)::]
a_half_int=a_half_int[::-1]
b=list(a_half)
c=list(a_half_int)
ans=0
for i in range(len(a)//2):
    if b[i] != c[i]:
        ans+=1

print(ans)

Solution (Python):
if __name__ == '__main__':

	S = list(input())

	num = len(S) // 2

	cnt = 0
	for i in range(num):
		if S[i] != S[-1-i]:
			cnt += 1

	print(cnt)

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

Solution (Python):
def min_number_changes_palindrome(input_str):
    first = ""
    second = ""
    half_len = int(len(input_str) / 2)
    first = input_str[:half_len]
    if len(input_str) % 2 == 0:
        second = input_str[half_len:]
    else:
        second = input_str[half_len + 1:]
    second = second[::-1]
    changes_count = 0
    for i in range(0, len(first)):
        if first[i] != second[i]:
            changes_count += 1
    return changes_count

print(min_number_changes_palindrome(input("")))

Solution (Python):
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
    if realcount == 0:
        real = 0
    else:
        real = realcount//2
print(real)

Solution (Python):


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-1)-i] = s_list[i]
    hag += 1
  
print(hag)

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

Solution (Python):
S = str(input())
count = 0
for i in range(0,len(S)) :
  if list(S)[i] != list(reversed(S))[i] :
    count+=1
print(int(count / 2))

Solution (Python):

import math
def main():
    S = input()
    S_len = len(S)
    hug_count = 0
    for i in range(math.floor(S_len/2)):
        if S[i] != S[S_len - (i+1)]:
            hug_count += 1
    print(hug_count)

if __name__ == "__main__":
    main()

Solution (Python):
s = input()
result = 0
reverseString = s[::-1]
for i in range(len(s)):
    if s[i] != reverseString[i]:
        result += 1
print(int(result / 2))

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

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

count=0
i=0
while("".join(s) != "".join(s_r)):
    
    if (s[i] != s_r[i]) and i<len(s):
        s[i] = s_r[i]
        s_r = s[::-1]
        count+=1
    i+=1
print(count)

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

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

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

Solution (Python):
s = list(input())
count = 0
if len(s) % 2 ==0:
  s1 = s[:len(s)//2]
  s2 = s[len(s)//2:]
else:
  s1 = s[:len(s)//2]
  s2 = s[len(s)//2+1:]
  
s2.reverse()

for (i,j) in zip(s1,s2):
  if i != j:
    count += 1
print(count)

Solution (Python):
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    

S=input()
cnt=0
for i in range(len(S)//2):
	if S[i]==S[-(i+1)]:
		cnt+=1

print(len(S)//2-cnt)

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

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

Solution (Python):
S = str(input())
ii = 0
for i in range(len(S)//2):
    if not S[i] == S[len(S)-i-1]:
        ii += 1
print(ii)

Solution (Python):
w1 = input()

wl1 = []
for i in w1:
  wl1.append(i)


n = len(wl1)
wl2 = [""] * n
for i in wl1:
  wl2[n-1] = i
  n -= 1


c = 0
for i in range(len(wl1)):
  if wl1[i] != wl2 [i]:
    c += 1
print(c//2)

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

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

Solution (Python):
s = raw_input()
print sum([s[i] != s[len(s)-1-i] for i in xrange(len(s))]) / 2

Solution (Python):
S = input()

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

Solution (Python):
def solve(s):
    n = len(s)
    ans = 0
    for i in range(n//2):
        if s[i] != s[-i-1]:
            ans += 1
    return ans

s = input()
print(solve(s))

Solution (Python):
S = input()

a = S
b = S[::-1]
n = round(len(S)/2)

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

print(ans)

Solution (Python):
s = input()
s_length = len(s)
s_plus = 0
for x in range(s_length // 2):
    if s[x] != s[s_length-1-x]:
        s_plus = s_plus + 1
print(s_plus)

Solution (Python):
S=list(input())
S_rev=list(reversed(S))
cnt=0
for i in range(len(S)):
    if S[i]!=S_rev[i]:
        cnt+=1
print(cnt//2)

Solution (Python):
S = input()
ans = 0

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

print (ans)

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

Solution (Python):
line = input()
count = 0
S = []
mojisuu = len(line)

for i in range(mojisuu):
    S.append(line[i])

if mojisuu % 2 == 0:
    for j in range(int(mojisuu/2)):
        if S[j] != S[j*(-1)-1]:
            count += 1


else:
    for k in range(int((mojisuu - 1)/2)):
        if S[k] != S[k*(-1)-1]:
            count += 1

print(count)

Solution (Python):
s = input()
n = int(len(s))
rev = s[::-1]
count = 0

if n%2 == 0:
  m = n//2
else:
  m = n//2 + 1
for i in range(m):
  if s[i] != rev[i]:
    count += 1

print(count)

Solution (Python):
S = input()
i = len(S) // 2 

cnt = 0
for x in range(i):
    
    if S[x] != S[-(x + 1)]:
        cnt += 1
    
print(cnt)

Solution (Python):
str = input()
n = int(len(str)/2)
count = 0
for i, x in enumerate(str):
    if i >= n: break
    if str[-i-1] != x: 
        count += 1
print(count)

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

Solution (Python):
s = input()
cnt = 0

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

Solution (Python):
s = input()
former = s[:len(s)//2]
latter = s[(len(s)+1)//2:][::-1]
print(sum([a != b for a,b in zip(former, latter)]))

Solution (Python):
s = input()
former = s[:len(s)//2]
latter = s[(len(s)+1)//2:][::-1]
print(sum([a != b for a,b in zip(former, latter)]))

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

Solution (Python):
def solve(s):
    n = len(s) // 2
    return str(sum(s0 != s1 for s0, s1 in zip(s[:n], s[::-1][:n])))


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))

Solution (Python):
s = input()
 
cnt = 0
b = int(len(s))
 
for a in range(int(b/2)):
    if s[a] != s[(b-a-1)]:
       cnt = cnt +1
print(cnt)

Solution (Python):
s = input()

cnt = 0
b = int(len(s))

for a in range(int(b/2)):
    if s[a] != s[(b-a-1)]:
       cnt = cnt +1
print(cnt)

Solution (Python):
s = input()
l = int(len(s))

t = l/2

t = int(t)
f = s[:t]
r = s[t:]
r = r[::-1]
f = list(f)
r = list(r)

c = 0
for i in range(t):
    if f[i] != r[i]:
        c +=1
    else:
        pass
print(c)

Solution (Python):
a = input()
list(a)
i = 0
j = len(a)-1
count = 0

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

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

Solution (Python):
s = input()
cnt =0

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

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

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

Solution (Python):






s = input()
cnt = 0

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

print(cnt)

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

Solution (Python):
s = input()

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

print(ans)

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

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

print(ans)

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

Solution (Python):
s = input()

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

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

Solution (Python):
s = input()
r = s[::1]
c = 0
for i, j in zip(s[:len(s)//2], s[::-1]):
    if i != j:
        c += 1
print(c)

Solution (Python):
s = input()

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

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

Solution (Python):
s = input()

cnt = 0
for elem1, elem2 in zip(s, reversed(s)):
  if elem1 != elem2:
    cnt += 1
print(cnt // 2)

Solution (Python):
strings = input()

lenstrings = len(strings)
res = 0

for i in range(lenstrings // 2):
    if strings[i] != strings[lenstrings-i-1]:
        res += 1

print(res)

Solution (Python):
a = list(input())
n = len(a)

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

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

Solution (Python):
s=input()
mid=len(s)//2
cnt=0
for c1, c2 in zip(s[:mid], s[:mid-1:-1]):
    if(c1!=c2):
        cnt+=1
print(cnt)

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

Solution (Python):
import sys, math
from collections import defaultdict
from copy import deepcopy
import itertools




S = input()
l = len(S)

ans = 0
if l % 2 == 0:
    n = l // 2
    
    for i in range(n):
        
        if S[i] != S[-i-1]:
            ans += 1
else:
    n = (l - 1) // 2
    for i in range(n):
        if S[i] != S[-i-1]:
            ans += 1

print(ans)

Solution (Python):
a = input()
len_a = len(a)
if len_a % 2 == 0:
    a1 =  a[:len(a)//2]
    a2 =  a[len(a)//2:][::-1]
else:
    a1 =  a[:len(a)//2]
    a2 =  a[len(a)//2+1:][::-1]
ans = 0
for i in range(len(a1)):
    ans += int(a1[i] != a2[i])
print(ans)

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

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

ans = 0

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

Solution (Python):
phi = input()
num = len(phi)
change = 0
for i in range(num):
  if i > num-1-i:
    break
  elif i != num-1-i:
    if phi[i] != phi[num-1-i]:
      change=change+1 
print(change)

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

Solution (Python):
S = input()

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

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

Solution (Python):
i=input()
lenght=len(i)
co=0
for index in range(int(lenght//2)):
    if i[index]!=i[lenght-index-1]:
        co+=1
print(co)

Solution (Python):


word = input()

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

Solution (Python):
s = str(input())
n = int(len(s))
p = s[0 : n//2]
s = s[n//2 : n+1]
hug = 0
s = s[len(s)::-1]
for i, m in zip(s, p):
  if i!=m:
    hug+=1
      
print(hug)

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

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

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

Solution (Python):
import math

S = list(input())
count = 0

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

print(count)

Solution (Python):
S = input()

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

print(count)

Solution (Python):
def main():
    S = input()
    
    center = len(S)//2
    F = S[:center]
    B = S[center:][::-1]

    counter = 0
    if not len(F) == len(B): 
        B = B[:-1]

    for i in range(len(F)):
        if not F[i] == B[i]:
            counter += 1

    print(counter)



main()

Solution (Python):
print((lambda s: int(len(list(filter(lambda a: a[0] != a[1], zip(list(s), list(s)[::-1]))))/ 2 ))(input()))

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

Solution (Python):

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

Solution (Python):
s = input()

n = len(s)

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

Solution (Python):


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(int(count)):
    if str[i] != rev_str[i] :
        result = result + 1

print(result)

Solution (Python):
def solve(S):
    mid = len(S) // 2
    num_change = 0
    for i in range(mid):
        if S[i] != S[len(S)-1-i]:
            num_change += 1
    return num_change


if __name__ == "__main__":
    import sys
    for line in sys.stdin:
        text = line.strip("\n")

    print(solve(text))

Solution (Python):
w = input()
wr = w[::-1]

ans = 0
for i in range(len(w)//2):
  if w[i]!=wr[i]: ans +=1
    
print(ans)

Solution (Python):
S = input()

l = len(S)
half_l = l // 2

hugs = 0
for i, s in enumerate(S[0:half_l]):
    if s != S[l - 1 - i]:
        hugs += 1

print(hugs)

Solution (Python):

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__":
    
    resolve()

Solution (Python):

import sys
import math
def resolve():
    S=list(input().rstrip())
    c=0
    for i in range(math.floor(len(S)/2)):
        if(S[i]!=S[len(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__":
    
    resolve()

Solution (Python):
S = list(input())
L = len(S)
C = 0

for i in range(int(L/2)):
    if S[i]!=S[L-i-1]:
        C+=1

print(C)

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

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

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

print(count)

Solution (Python):
s = input().strip()
r = 0
for i in range(len(s)//2):
    if s[i] != s[len(s)-1-i]:
        r += 1
print(r)

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

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

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

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

Solution (Python):
s = input()
lens = len(s)
ans = 0
s1,s2 = s[:lens//2],s[lens//2:]
s2=s2[::-1]
for i,j in zip(s1,s2):
  if i!=j:
    ans+=1
print(ans)

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

Solution (Python):
a = input()


s = 0
e = len(a)

cnt = 0
for i in range(e):
	e_i = e - i - 1

	if (a[i] != a[e_i]):
		a = a[:i] + a[e_i] + a[i+1:]
		cnt += 1
print(cnt)

Solution (Python):
str_list = list(input())
c = 0

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

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

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

print(x)

Solution (Python):
a = input()
leng = len(a)
list(a)
time = 0

if leng % 2 == 0:
    for i in range(int(leng / 2)):
        if a[i] != a[-i - 1]:
            time += 1
else:
    for i in range(round(leng/ 2)):
        if a[i] != a[-i - 1]:
            time += 1

print(time)

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

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

count =0

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

print(count)

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

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

print(count)

Solution (Python):
import sys
import functools
import operator

def main():
   s = sys.stdin.readline().strip()
   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)), 0)
   print(n)

if __name__ == '__main__':
    main()

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

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

print(count)

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

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

Solution (Python):
S = str(input())
s = [i for i in range(int(len(S) / 2)) if S[i] != S[-i - 1]]
print(len(s))

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

Solution (Python):
cap_list = list(input())
turn = len(cap_list) / 2
counter = 0
for i in range(len(cap_list)):
    if i >= turn:
        break
    if cap_list[i] != cap_list[-(i + 1)]:
        counter += 1
print(counter)

Solution (Python):
def main():
    try:
        S = input()
        cnt = 0
        for i in range(len(S)//2):
            if S[i] != S[-(i+1)]:
                cnt += 1
        print(cnt)
    except SystemExit:
        pass
if __name__ == "__main__":
    main()

Solution (Python):
s=input();print(sum([s[i]!=s[len(s)-1-i]for i in range(len(s)//2)]))

Solution (Python):
s = input()

count = 0

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

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

count = 0

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

Solution (Python):
s = input()
slen = len(s)
fs = ""
bs = ""
a = 0

if slen%2==1:
    fs = s[0:(slen//2)+1]
    bs = (s[::-1])[0:(slen//2)+1]

else:
    fs = s[0:(slen//2)]
    bs = (s[::-1])[0:(slen//2)]

for f,b in zip(fs,bs):
    if f != b:
        a += 1

print(a)

Solution (Python):
s=list(input())
s_reverse=s[::-1]
n=len(s)
cnt=0
for i in range(n):
    if s[i]!=s_reverse[i]:
        cnt+=1
print(cnt//2)

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

Solution (Python):
s = input()

rev = s[::-1]

cnt = 0
for se, reve in zip(s, rev):
    if se != reve:
        cnt += 1

cnt //= 2
print(cnt)

Solution (Python):
s = input()
count = 0

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

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

br = 0

for i in range(n):
    if (s[i] != s[n-i-1]):
        
        br += 1

print(br//2)

Solution (Python):
S = input()

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

Solution (Python):
s = input()
cnt = 0
for i in range(0, len(s)//2):
	if s[i] is not s[len(s) - i - 1]:
		cnt += 1
		
print(cnt)

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

Solution (Python):
a=input()
n=len(a)
li=list(a)
b=0
for k in range(0,n//2):
    if not li[k]==li[n-1-k]:
        b=b+1

print(b)

Solution (Python):
s = input()

n = len(s)//2

j = len(s) - 1

ans = 0



for i in range(n)  :
	if s[i] != s[j] :
		ans+=1
	j = j - 1

print(ans)

Solution (Python):
from sys import stdin
a = stdin.readline().rstrip()
a = list(str(a))
cnt = 0
e = 0
if len(a)%2 == 0:
	end = len(a)//2 
else:
	end = len(a)//2 +1

for s,t in zip(a,a[::-1]):
	cnt +=1
	if s != t:
		e += 1
	if cnt == end:
		break

                   
print(e)

Solution (Python):
ch = input()
chlen = len(ch)
num = 0

for i in range(int(chlen/2)):
  if(ch[i] != ch[chlen-i-1]):
    num+=1
print(num)

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

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

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

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

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

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

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

Solution (Python):
S = [i for i in input()]
N = len(S)
f_counter = 0
for j in range(N):
    if S[j] != S[N-1-j]:
        f_counter += 1
counter = f_counter / 2
print('{:.0f}'.format(counter))

Solution (Python):
s=input()
a=0
if len(s)==1:
    print(a)
else:
    s_t = s[:int(len(s)/2)], s[int(len(s)/2):]
    a += int(s_t[0][:1] != s_t[1][-1:])
    for i in range(1, len(s_t[0])):
        a += int(s_t[0][i:i+1] != s_t[1][-(i+1):-i])
    print(a)

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

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

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

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

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

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

c = len(ls)
c = int(c/2+0.5)

ans = 0
for i in range(c):
    if (ls[i] != ls[-i-1]):
        ans += 1

print(ans)

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

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

l = len(s)//2

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

print(cnt)

Solution (Python):



list1=str(input())
b=len(list1)
i=0
counter=0
while b/2>i:
    if list1[i]!=list1[b-1-i]:
        counter+=1
    i+=1
print(counter)

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

Solution (Python):
s = input()
l = len(s)
ans = 0
i = 1
j = 0
if l%2 == 0:
	while(i <= l/2):
		if s[j] != s[-i]:
			ans += 1
		j+=1
		i+=1
else:
	max = l/2
	while(j < max):
		if s[j] != s[-i]:
			ans += 1
		j+=1
		i+=1
			
print(ans)

Solution (Python):
s = input()
l = len(s)
ans = 0
i = 1
j = 0
if l%2 == 0:
	while(i <= l/2):
		if s[j] != s[-i]:
			ans += 1
		j+=1
		i+=1
else:
	max = l/2
	while(j < max):
		if s[j] != s[-i]:
			ans += 1
		j+=1
		i+=1
			
print(ans)

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

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

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

Solution (Python):
S = input()



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

Solution (Python):
import numpy as np

S=input()

half_a=''
half_b=''

if len(S)%2==0:
    half_a=np.array(list(S[int(len(S)/2):]))
    half_b=np.array(list(S[:int(len(S)/2)][::-1]))
    
if len(S)%2==1:
    half_a=np.array(list(S[int(len(S)/2)+1:]))
    half_b=np.array(list(S[:int(len(S)/2)][::-1]))


print(np.sum(half_a!=half_b))

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

Solution (Python):
a = str(input())
ans = 0

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

Solution (Python):
S =input()



count = 0


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

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

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

print(c)

Solution (Python):
parin = input()
counter = 0

for i in range(int(len(parin) // 2)):
    if parin[i] != parin[-i-1]:
        counter += 1
    
print(counter)

Solution (Python):
S1 = input()
S2 = S1[::-1]

l = len(S1)
count = 0
for i, j in zip(S1[:l//2], S2[:l//2]):
    if i != j:
        count += 1

print(count)

Solution (Python):
S = input()
def funct(S):
    changes = 0
    for i in range(0,len(S)//2):
        if(S[i] != S[len(S)-1-i]):
            changes += 1
    print(changes)

funct(S)

Solution (Python):
import math
def mainFunc( input ):
    letters = list(input)
    ans = 0
    n = math.floor(len(letters) / 2)

    for i in range(n):
        if letters[i] != letters[len(letters) - 1 - i]:
            ans += 1
    
    print(ans)

mainFunc(input())

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

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

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

Solution (Python):
a = input()
print(sum([a>b for a,b in zip(a,a[::-1])]))

Solution (Python):
s = input()
chars = list(s)
count = 0

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

Solution (Python):
s = input()
l = len(s)
center = l // 2
a = s[:center]
b = s[:center-1:-1]
cnt = 0 
for i in range(len(a)):
    if a[i] != b[i]:
        cnt += 1
print(cnt)

Solution (Python):
s = input()
ans = 0

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

print(ans)

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

Solution (Python):
s1 = input()
s2 = s1[::-1]

cnt = 0
for i in range(len(s1)//2):
    if s1[i]!=s2[i]:
        cnt+=1
print(cnt)

Solution (Python):
s=list(input())
t=list(reversed(s))
cnt=0
for i in range(len(s)//2):
    if s[i]!=t[i]:
        cnt+=1
print(cnt)

Solution (Python):
s = input()  
num = int(len(s) / 2)
j = len(s) - 1
ans = 0
for i in range(num):
    if s[i] != s[i + j]:
         ans += 1
    j -= 2

print(ans)

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

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

print(count)

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

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