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 = str(input())

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

ans = 0
for n in range(len(S1)):
    if S1[n] != S2[n]:
        ans += 1

print(ans)

Solution (Python):
S = input()


itelist = []
slen = int(len(S))
for j in range(int(slen/2),slen):
    itelist.append(j)
revitelist = []
for i in (reversed(itelist)):
    revitelist.append(i)
count = 0
for i in range(0,int(slen/2)):
    if S[i] == S[revitelist[i]]:
        pass
    elif S[i] != S[revitelist[i]]:
        
        count += 1
print(count)

Solution (Python):

S = list(str(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()
s=list(s)
a=0

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

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

def is_even(num):
    if num % 2 == 0:
        return True
    else:
        return False

change_num = math.floor(len(N) / 2)
ans = 0
count = 1
for i in N[:change_num]:
    if N[-count] != i:
        ans += 1
    count += 1
    
print(ans)

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

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

def kai(str):
    return 1 if str == str[::-1] else 0

buf=kai(S)

count=0

if buf==True:
    print(0)
else:
    if len(S)%2==0:
        tmp=S[0:int(len(S)/2)]
        tmp2=S[int(len(S)/2):len(S)+1]
        for a,b in zip(tmp,tmp2[::-1]):
            if a!=b:
                count+=1
    else:
        tmp=S[0:int(len(S)/2)]
        tmp2=S[int(len(S)/2)+1:len(S)+1]
        for a,b in zip(tmp,tmp2[::-1]):
            if a!=b:
                count+=1

if count!=0:
    print(count)

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

n = len(string)

def isEven(N):
    return True if N % 2 == 0 else False

if isEven(n):
    n_half = int(n/2)
else:
    n_half = int(n/2) + 1

left_str = []
right_str = []

for i in range(0,n_half):
    
    left_str.append(string[i])
    right_str.append(string[n-1-i])


notMatch = 0
for i in range(0,len(left_str)):
    if left_str[i] != right_str[i]:
        notMatch += 1
    else:
        continue

print(notMatch)

Solution (Python):
"""
n = int(input())
a = list(map(int,input().split()))
for i in range(n):
def xor(x):
	for j in range(n):
		x = bin(x ^ a[j])
		x= int(x[2:])


"""
s = list(input())
k = len(s)//2
a =0
for i in range(k):
	if s[i] is not s[len(s)-i-1]:
		a+=1

print(a)

Solution (Python):
s = input()
l = len(s)
s3 = ""
if l%2 == 0:
    s1=s[:l//2]
    s2=s[l//2:]
else:
    s1=s[:l//2]
    s2=s[l//2+1:]
hug = 0
for i in range(l//2):
    if s1[-i-1] != s2[i]:
        hug += 1
print(hug)

Solution (Python):
s = input()

count = 0
if len(s) % 2 == 0:
    start = s[:len(s) // 2]
    end = s[len(s) // 2: len(s)]
    end = end[::-1]

    for i, st in enumerate(start):
        if st != end[i]:
            count = count + 1
else:
    start = s[:len(s) // 2]
    end = s[len(s) // 2: len(s)]
    end = end[::-1]

    for i, st in enumerate(start):
        if st != end[i]:
            count = count + 1

print(count)

Solution (Python):
s = input()
print(sum(1 for a, b in zip(s, reversed(s)) if a != b) // 2)

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

Solution (Python):
def A():
    nums = [int(n) for n in input().split()]
    if sum(nums) >= 22:
        print('bust')
    else:
        print('win')

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

Solution (Python):

s = input()

n=len(s)
if n%2==0:
  s_left = s[:n//2]
  s_right = s[n//2:]
else:
  s_left = s[:n//2]
  s_right = s[n//2+1:]
  
s_right = s_right[::-1]
  
count=0
for r,l in zip(s_left, s_right):
  if r!=l:
    count+=1
print(count)

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

Solution (Python):
import math

s = input()
n = len(s)

l = math.floor(n/2)
if n % 2 == 0:
  k = l
else:
  k = l+1
  

s_f = s[:l]
s_r = s[k:]
j = 0




for i in range(0,l):
  if s_f[i] != s_r[(l-1)-i]:
    
    j+=1
    
print(j)

Solution (Python):
import math

a = input()
b = math.floor(len(a)/2)
N = len(a)-1
count = 0

for i in range(b):
  if a[i] == a[N-i]:
    pass
  else:
    count += 1
print(count)

Solution (Python):
s = input()

count = 0
Len = len(s)
half = Len//2
if Len%2 == 0:
    left = s[:half]
    right = s[half:]
    reverse_right = s[::-1]
    
    for i in range(half):
        if left[i] != reverse_right[i]:
            count += 1

else:
    left = s[:half]
    right = s[(half+1):]
    reverse_right = s[::-1]
    
    for i in range(half):
        if left[i] != reverse_right[i]:
            count += 1

print(count)

Solution (Python):
s = input()

sl = len(s)//2
count = 0

if len(s)%2==0:
  s1 = s[:sl]
  s2 = s[sl:]
    
else:
  s1 = s[:sl]
  s2 = s[sl+1:]

for l in range(len(s1)):
  if s1[l]!=s2[len(s1)-1-l]:
    count += 1
    
print(count)

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

print(s)

Solution (Python):
S=input()

count=[]
for i in range(len(S)):
	if S[i]!=S[len(S)-1-i]:
		count.append(i)

if count==[]:
	print(0)
else:
	print(len(count)//2)

Solution (Python):
n = input()
a = len(n) % 2

b = []
c = []

res = 0

s = n[0:len(n) // 2]
for i in range(len(n) // 2):
  b.append(n[len(n) - i - 1])
  c.append(n[i])

for i, j in zip(b, c):
  if i != j:
    res += 1
print(res)

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

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

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

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

print(ans)

Solution (Python):

def main():
    S = list(str(input()))
    S2 = list(reversed(S))
    N = len(S)//2
    ans = 0
    for i in range(N):
        if S[i] != S2[i]:
            ans += 1
    print(ans)



if __name__ == '__main__':
    main()

Solution (Python):
s = input()

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

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

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

Solution (Python):
s = input()
a = s[::-1]
ans = 0

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

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

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

print(counter)

Solution (Python):
s = input()

count = 0
for i in range(len(s)//2):
  if s[i] == s[-(i+1)]:
    continue
  else:
    count += 1

print(count)

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


D=0
for n in range(C):
        if S[n]!=S[C-n-1]:
            D=D+1
print(round(D/2))

Solution (Python):
n = input()
a = len(n) % 2

b = []
c = []

res = 0
if a == 0:
  s = n[0:len(n) // 2]
  for i in range(len(n) // 2):
    b.append(n[len(n) - i - 1])
    c.append(n[i])
elif a == 1:
  s = n[0:len(n) // 2 ]
  for i in range(len(n) // 2 ):
    b.append(n[len(n) - i - 1])
    c.append(n[i])

for i, j in zip(b, c):
  if i != j:
    res += 1
print(res)

Solution (Python):
s=list(input())
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()
s2 = list(reversed(s))

ans = 0

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

print(int(ans / 2))

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

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

Solution (Python):
S = input()

L = len(S)
left = S[:L//2]
right = S[L//2:]
S_re = S[::-1]
re_left = S_re[:L//2]
re_right = S_re[L//2:]

answer = 0
for s,s_re in zip(S, S_re):
    if s != s_re:
        answer += 1 
print(answer//2)

Solution (Python):
s = list(input())
l = len(s)//2

def check(t,s):
  ans = 0
  for i in range(l):
    if s[i]!=t[i]:
      ans+=1
  print(ans)
      
if len(s)%2==0:
  t = list(reversed(s[l:]))
  check(t,s)
else:
  t = list(reversed(s[l+1:]))
  check(t,s)

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

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

r = s[::-1]
cnt = 0

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

print(cnt)

Solution (Python):
import math
S = input()
ans = 0
n = math.floor(len(S)/2)
S1 = S[:n]
S2 = reversed(S[-n:])
for s1, s2 in zip(S1, S2):
    if s1 != s2:
        ans += 1
print(ans)

Solution (Python):
a = list(input())
n = int(len(a))
count = 0
if n%2==0:
    ran = int(n/2)
else:
    ran = int((n+1)/2)

for i in range(0,ran):
    if a[i]!=a[n-i-1]:
        count+=1
print(count)

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

Solution (Python):
import math

S = input()
half = math.ceil(len(S) / 2)
count = 0

arr = list(S)
rev = list(S)
rev.reverse()

for i in range(half):
  if rev[i] != arr[i]:
    count += 1

print(count)

Solution (Python):

S=input()
P=0
for i in range (0,len(S)//2): 
  if S[i]==S[-i-1]:
      continue
  else:
      P+=1
print(P)

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

cnt = 0
for l0, l1 in zip(S0, S1):
    if not l0 == l1:
        cnt += 1

print(cnt // 2)

Solution (Python):
str = input()
l = len(str)
p = l-1
index = 0
cnt=0
if l==1:
    print(0)
    exit()
if l==2:
    if str[0]==str[1]:
        print(0)
        exit()
    else:
        print(1)
        exit()
while index < p:

    if str[index] == str[p]:
        index = index + 1
        p = p-1
        if index == p or index + 1 == p:
            if str[index] == str[p]:
                print(cnt)
                exit()
            else:
                cnt+=1
                print(cnt)
                exit()
    else:
        cnt+=1
        index = index + 1
        p = p-1
        if index == p or index + 1 == p:
            if str[index] == str[p]:
                print(cnt)
                exit()
            else:
                cnt+=1
                print(cnt)
                exit()

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

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

print(count)

Solution (Python):
S = input()
count=0
length = len(S)


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


print(count)

Solution (Python):
s=input()

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

print(hug)

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

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

count = 0
ans = [0] * len(s)
for i in range(len(s)):
    if s[i] != s_b[i]:
        count += 1
        ans[i] = 1


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


print(ans.count(1)//2)

Solution (Python):
S = input()

s_len = len(S)

if s_len%2 == 0:
  s1 = S[:s_len//2]
  s2 = S[:s_len//2-1:-1]
else:
  s1 = S[:s_len//2]
  s2 = S[:s_len//2:-1]

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

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

for i in range(n//2):
  if str1[i] == str1[-(i+1)]:
    pass
  else:
    ans += 1
    
print(ans)

Solution (Python):

import sys
from itertools import product
from collections import Counter, defaultdict
from string import ascii_uppercase as ABC

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

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()
l=len(s)
naga=l//2
ans=0
for i in range(naga):
    if(s[i]!=s[-i-1]):
        ans+=1

print(ans)

Solution (Python):
S = input()

l = len(S)

if l % 2 == 1:
    h= l//2
    a = S[:h+1]
    b = S[h:]
else:
    h= l//2
    a=S[:h]
    b=S[h:]

b = ''.join(list(reversed(b)))
al = list(a)
bl = list(b)

c = 0
for i,p in enumerate(al):
    if(p != bl[i]):
        c = c+1
    
print(c)

Solution (Python):
from sys import stdin
input = list(stdin.readline().rstrip())

n = len(input)

if n % 2 == 1:
    del input[n//2]
    n = len(input)
cnt = 0
for i in range(int(n/2)-1, -1, -1):
    if input[i] != input[n-i-1]:
        cnt += 1

print(cnt)

Solution (Python):
string = input()
lengch = len(string)
halfLengch = lengch // 2
startString = list(string[:halfLengch])
endString = list(string[:halfLengch - 1:-1])
countHug = 0
 
for i,j in zip(startString, endString) :
    if i != j :
      countHug += 1
 
print(countHug)

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

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

print(cnt)

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

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


len = len(S)
loop = len//2
count = 0





for i in range(1,loop+1):
    
    

    if S[i-1]!=S[-i]:
        count = count + 1
        

print(count)

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

l = 0
r = len(s)-1

c = 0
while l<=r:
  if s[l] != s[r]:
    c += 1
  l += 1
  r -= 1
print(c)

Solution (Python):
org = list(input())
org_rev = org[::-1]
org_rev

n = len(org)//2
sum=0
for i in range(n):
    if org[i] != org_rev[i]:
        sum = sum + 1
print(sum)

Solution (Python):
s=list(input())
ls=len(s)
fh=s[:ls//2]
lh=s[ls//2:] if ls%2==0 else s[ls//2+1:]
lh.reverse()
for i in range(len(fh)):
    if fh[i]==lh[i]:
        fh[i]="N"
while "N" in fh:
    fh.remove("N")
print(len(fh))

Solution (Python):
S = input()
h = int(len(S)/2)
x = 0
y = -1
ans = 0

for i in range(h):
    if(S[x] != S[y]):
        ans += 1
    x += 1
    y -= 1

print(ans)

Solution (Python):
S = input()

length =  len(S)

if (length == 1):
    print('0')
    exit()

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

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

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


if __name__ == '__main__':
    do_code()

Solution (Python):
x=[i for i in input()]
count=0

if len(x)%2!=0:
  x.pop(len(x)//2)

P =[p for p in range(0,len(x)//2)]
Q =[q for q in range(len(x)//2,len(x))]
Q.sort(reverse=True)
for a,b in zip(P,Q):
  if x[a]!=x[b]:
    count+=1
print(count)

Solution (Python):
S=list(map(str,input()))
N=len(S)
cnt=0
SR=S[:]
SR.reverse()

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

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


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

      
print(count)

Solution (Python):
s = input()

n = len(s) // 2

words_left = s[:n]
words_right = s[n:]

count = 0
i = 0
while i < n:
    j = i * -1 - 1
    if words_left[i] != words_right[j]:
        count += 1
    else:
        pass
    i += 1
    
print(count)

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

Solution (Python):
s = str(input())
x = len(s)
ans = 0
if x % 2 == 0:
    y = int(x / 2)
    for i,j in zip(s[:y],s[:y-1:-1]):
        if i == j:
            pass
        else:
            ans += 1
else:
    z = int(x // 2)
    for i,j in zip(s[:z],s[:z:-1]):
        if i == j:
            pass
        else:
            ans += 1
print(ans)

Solution (Python):
S = input()

if len(S) %2==0:
    L = len(S)//2
else:
    L = len(S)//2+1
    
ans = 0

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

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

print(count)

Solution (Python):
S = str(input())
S_l = list(S)
rS = list(reversed(S))
count = 0

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

Solution (Python):
str=input()


h=0
for i in range( int(len(str)/2)):

  if str[i]!=str[len(str)-i-1]:
    h+=1
print(h)

Solution (Python):
import math
text = input()
hugcount = 0
for i in range(math.ceil(len(text)/2)):
	if text[i] != text[-i-1]:
		hugcount += 1
print(hugcount)

Solution (Python):
S = input() 
rev = S[::-1]

l = int(len(S)/2)
front = S[0:l]
back = rev[0:l]

cnt = 0
moji = 0

for s in front:
    if front[cnt] == back[cnt]:
        moji += 1
    cnt += 1

ans = l - moji
print(ans)

Solution (Python):
import math
import random
from operator import itemgetter
import re
import sys
from itertools import accumulate
from collections import defaultdict
from collections import deque
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from fractions import gcd
from copy import deepcopy
input = sys.stdin.readline
S = input().strip()
num = len(S)
if num%2 == 0:
    left = S[:num//2]
    right = S[num//2:]
else:
    left = S[:num//2]
    right = S[num//2+1:]
right = right[::-1]
ans = 0
for i in range(len(left)):
    if left[i] != right[i]:
        ans += 1
print(ans)

Solution (Python):
S = input()

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

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

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

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):
title = str(input())
leng = len(title)
times = 0
if not leng % 2:
  for i in range(1, int(leng/2)+1):
    if not title[-i] == title[-leng+i+-1]:
      title[-i].replace(title[-i], title[-leng+i-1])
      times += 1
else:
  for i in range(1, int(leng/2)+1):
    if not title[-i] == title[-leng+i-1]:
      title[-i].replace(title[-i], title[-leng+i-1])
      times += 1
print(times)

Solution (Python):
s = 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()

a=[]
for i  in range(len(S)):
    a.append(S[i])

count=0
for i in range(len(a)//2):
    if a[i]==a[(len(a)-1)-i]:
        pass
    else:
        count+=1

print(count)

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

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

print(cnt//2)

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

Solution (Python):
Y=str(input())
X=[]
X=list(Y) 

n=len(X)
m=0
if n%2==0:
    for i in range (0,n):
        if X[i]==X[n-i-1]:
            m=m+1
        else:
            m=m
    a=(n-m)/2
elif n%2==1:
    for i in range(0,n):
        if X[i]==X[n-i-1]:
            m=m+1
        else:
            m=m
    a=(n-m)/2
print(int(a))

Solution (Python):
S = input()

print(sum(a != b for a, b in zip(S[:len(S) // 2], S[-1::-1])))

Solution (Python):

S = input()

if len(S) == 1:
    print(0)
else:

    
    

    cen = int(len(S) / 2) - 1

    left = list(S[:cen + 1])

    if len(S) % 2 == 1:
        right = S[cen+2:]
    else:
        right = S[cen+1:]

    right = list(reversed(right))

    cnt = 0
    for l, r in zip(left, right):
        if l != r:
            cnt+=1

    print(cnt)

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

Solution (Python):
s = list(input())
rs=list(reversed(s))
count = 0

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

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

Solution (Python):
str=input()
kazu=len(str)
count=0

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

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

Solution (Python):
n = input()
x = 0
L = len(n)
for i in range(L):
    if i < L / 2:
        if n[i] != n[(i + 1) * -1]:
            x += 1

print(x)

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

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

m=list(reversed(l))

n=[]
for x in range(len(l)):
  if(l[x] != m[x]):
    n.append(l[x])

print(str(int(len(n)/2)))

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

Solution (Python):
b = input()
a = [k for k in b]
l = len(a)
num = 0
h = l/2
i = int(h)
if l//2 == 0:
  for j in range(i):
    if a[j] != a[-1-j]:
      num += 1
else:
  for j in range(i):
    if a[j] != a[-1-j]:
      num += 1

print(num)

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

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

Solution (Python):
lst_string = list(input())
len_s = len(lst_string)

ans = 0

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

print(ans)

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

S_zen = list(S[0:len(S)//2])
S_kou = list(reversed(list(S[len(S)//2:])))




cnt =0

for i in range(len(S_zen)):
    if not S_zen[i] == S_kou[i]:
        cnt +=1
print(cnt)

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

Solution (Python):
S = str(input())
f = 0

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

Solution (Python):
S = input()
list_S = list(S)
str_len = int(len(list_S) / 2)
one = list(S[:str_len])
two = list(reversed(list(S[-str_len:])))  
hug = 0
for i in range(len(one)):
  if not one[i] == two[i]:
    hug = hug + 1
print(hug)

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

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

Solution (Python):
n = input()
new = n[::-1]


j = 0
hug =0
for i in reversed(n):
    if i != n[j]:
      hug = hug  + 1 
    j = j + 1
print(int(hug/2))

Solution (Python):
S = input()

count = 0

num = int(len(S)/2)

for i in range (0,num):

     if S[i] != S[-i-1]:
         count += 1
print(count)

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

Solution (Python):


''' 
------------------------
author : iiou16
------------------------
'''

def main():
    S = list(input())

    l = len(S) // 2
    s1 = S[:l]
    s2 = list(reversed(S[l:]))
    
    count = 0
    
    for i in range(l):
        if s1[i] != s2[i]:
            count += 1
    print(count)


if __name__ == '__main__':
    main()

Solution (Python):
S = input()

Slen = len(S)
center = int(Slen/2)

Answer = 0

a = S[:center]
b = S[-1:center-1:-1]

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

print(Answer)

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

Solution (Python):
S = input()
if len(S) % 2 == 0:
    former = S[:len(S) // 2]
    latter = S[len(S) // 2:]
else:
    former = S[:len(S) // 2]
    latter = S[len(S) // 2 + 1:]

count = 0
for c_former, c_latter in zip(former, latter[::-1]):
    if c_former != c_latter:
        count += 1
print(count)

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

Solution (Python):
s = input()

ct = 0
for i,j in zip(s,s[::-1]):
    if i != j:
        ct += 1
        
print(ct//2)

Solution (Python):
palindromo = input()
i = 0
j = len(palindromo) - 1
count = 0
while(i < j):
	if(palindromo[i] != palindromo[j]):
		count += 1
	i += 1
	j -= 1
print(count)

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

Solution (Python):
S = list(str(input()))
count = 0

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

Solution (Python):
s = input()
count = 0
for i,ele in enumerate(list(s)):
    if ele != s[::-1][i]:
        count+=1

print(count//2)

Solution (Python):
s = list(input(''))
b = []
ans = 0
for i in (reversed(s)):
    b.append(i)

for l in range(len(s)):
    if s[l] != b[l]:
        ans += 1
print(int(ans/2))

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

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

Solution (Python):
s = input()

n = len(s) // 2

sf = s[0:n]
ss = s[::-1]
sb = ss[0:n]
cnt = 0
for i in range(n):
    if sf[i] != sb[i]:
        cnt += 1
print(cnt)

Solution (Python):
s = list(input())
length = len(s)
ans = 0

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

print(ans)

Solution (Python):
import math
s=input()
S_list = [s[i: i+1] for i in range(0, len(s))]
sumup=0
if len(S_list)%2==0:
  for i in range(math.floor(len(S_list)/2)):
    if S_list[i]!=S_list[len(S_list)-i-1]:
      sumup+=1
  print(sumup)
else:
  for i in range(math.floor((len(S_list)-1)/2)):
    if S_list[i]!=S_list[len(S_list)-i-1]:
      sumup+=1
  print(sumup)

Solution (Python):
S = list(input())
a = len(S)//2
b = S[:a]
c = S[-a:]

cnt = 0
for i in range(a):
    if b[i]!=c[-i-1]:
        cnt += 1

print(cnt)

Solution (Python):
string = str(input())
length = len(string)

t = 0
c = 0

def check(moji1,moji2):
    moji2 = list(moji2)
    moji1 = list(moji1)
    count = 0
    for i in range(t):
        if moji1[i] != moji2[i]:
            count += 1
    return count

if length % 2:
    t = int((length - 1)/2)
    mojimoji = list(string)
    newmoji1 = ""
    newmoji2 = ""
    for a in range(t):
        newmoji1 += mojimoji[a]
        newmoji2 += mojimoji[length-(1+a)]
    c = check(newmoji1,newmoji2)

else:
    t = int(length/2)
    mojimoji = list(string)
    newmoji1 = ""
    newmoji2 = ""
    for a in range(t):
        newmoji1 += mojimoji[a]
        newmoji2 += mojimoji[length-(1+a)]
    c = check(newmoji1,newmoji2)


print(c)

Solution (Python):
S = input()
r_s = S[::-1]

s_list = list(S)
rs_list = list(r_s)

cnt = 0
for i in range(len(S)):
    if s_list[i] != rs_list[i]:
        cnt += 1

print(int(cnt / 2))

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


print(count)

Solution (Python):
s = list(input())
sr = []
ans=0
m = len(s)//2

for i in s[::-1]:
    sr.append(i)


for i in range(m):
    if s[i] != sr[i]:
        ans +=1

print(ans)

Solution (Python):
s = str(input())
S = s[::-1]
cnt = 0

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

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



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

        count += 1
print(count)

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

Solution (Python):
s = input()

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

Solution (Python):
S=str(input().split())
s=list(S)
a=-1
t=s[::-1]

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

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

new_s = ''.join(list(reversed(s)))
count=0
for i in range(0,s_length):
    if s[i]==new_s[i]:
        count=count+0
    else:
        count=count+1
print(int(count/2))

Solution (Python):
s = raw_input()

l = len(s)

if l % 2 == 0:
    a = l/2 - 1
    b = a+1
else:
    a = l/2 - 1
    b = a+2

count = 0
while (a >= 0):
    
    if s[a]!=s[b]:
        count += 1
    a = a-1
    b = b+1

print count

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

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

print(count)

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

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

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

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

i = 0
count = 0
while i < len(S) / 2:
    if a[i] != a[-(i + 1)]:
        count += 1
    i += 1

print(count)