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()
N = len(S)
result = 0

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

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()

x = len(S)//2
S_1 = S[:x]
S_2 = S[x:]
S_3 = S_2[::-1]

cont = 0
for i in range(x):
  if S_1[i] != S_3[i]:
    cont += 1
print(cont)

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

print(cnt)

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

Solution (Python):
import sys
 
def main():
  S = list(input())
  
  sum = 0
  for i in range(0,int(len(S)//2)):
    if S[i]!=S[len(S)-i-1]:
    	sum+=1
               
  print(sum)
               
main()

Solution (Python):


s = input()

list(s)


isNotKaibun = 0

if len(s)%2 == 0:
    c = len(s)//2
else:
    c = len(s)//2 +1

for num in range(c):
    if s[num] == s[-(num+1)]:



        pass
    else:
        isNotKaibun += 1




print(isNotKaibun)

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

Solution (Python):
A = input()
half = int(len(A)/2)
A_reversed = list(reversed(A))
count = 0
for x in range(half):
    if(A[x]!=A_reversed[x]):
        
        count +=1
print(count)

Solution (Python):
s=input()
n=len(s)
ans=0
for i in range(n//2):
    if s[i]!=s[n-1-i]: 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):



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()
le = len(s)//2
c = 0
for i in range(le):
    if s[i] == s[-1*(i+1)]:
        pass
    else:
        c += 1
print(c)

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[len(s)-1-i]:
    ans+=1
print(ans)

Solution (Python):
S = input()

half_length = int(len(S) / 2)
cnt = 0
front = []
back = []

if len(S) % 2 == 0:
    front = list(S[ 0 : half_length ])
    back = list((S[ half_length : len(S)]))
else:
    front = list((S[ 0 : int(len(S) / 2) ]))
    back = list((S[ int(len(S) / 2) + 1 : len(S)]))


back.reverse()

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

print(cnt)

Solution (Python):
targetS = list(input())
targetS_r = list(reversed(targetS))
targetS_1 = []
targetS_2 = []
for target_list in range(int(len(targetS) / 2)):
    targetS_1.append(targetS[target_list])
    targetS_2.append(targetS_r[target_list])
count = 0
for target_list in range(int(len(targetS_1))):
    if targetS_1[target_list] != targetS_2[target_list]:
        count = count + 1
print(count)

Solution (Python):
import math

s = input()
n = math.floor(len(s) / 2)
c = 0

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

print(c)

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

Solution (Python):
S = input()
n1 = len(S)
n2 = round(n1 / 2)

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

print(cnt)

Solution (Python):
s=input()
l=len(s)
count=0
for i in range(l//2):
    if s[i]!=s[l-1-i]:
        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()
   
hug = 0
    
for i in range(len(S)//2):
    if S[i] != S[len(S) - 1 - i]:
        hug += 1
        
print(hug)

Solution (Python):
s = str(input())
x = len(s)
tmp = 0

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

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

print(tmp)

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

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

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

print(result)

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

Solution (Python):
S = input()

ans = 0

for n in range(0,len(S)):
  if S[n] == S[-1-n]:
    pass
  else:
    ans = ans+1
    
print(int(ans/2))

Solution (Python):



S = 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()
i = 0
flag = 0
while len(S)-1-i*2>0:
    if S[i] != S[len(S) - i-1]:
        flag +=1
    i+=1

print(flag)

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


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

    return t


print(main())

Solution (Python):
str = input()

ans = 0
for i in range(len(str)):
    if (i >= int(len(str)/2)):
        break

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

print (ans)

Solution (Python):
S = input()
if S.islower():
  S1 = S[:int(len(S)/2)]
  S2 = S[int(len(S)/2):]
  count = 0
  for i,x in enumerate(S1):
    if x != S2[(i+1)*-1]:
      count += 1
  print(count)

Solution (Python):
S = input().strip()
R = S[::-1]

ans = 0
for s, r in zip(S, R):
    if s != r:
        ans += 1

print(ans//2)

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

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

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

Solution (Python):
s = input()

cnt = 0
for i in range(len(s)//2) :
    if (s[i] != s[len(s)-1-i]) :
        cnt = 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();print(sum(1 for i in range(len(s)//2) if s[i]!=s[-i-1]))

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

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

print(ans)

Solution (Python):

s = raw_input()

if len(s) % 2 == 0:
    i, j = len(s)/2-1, len(s)/2
else:
    i, j = len(s)/2-1, len(s)/2 + 1 

ans = 0 
while i >= 0:
    if s[i] != s[j]:
        ans += 1
    i -= 1
    j += 1

print ans

Solution (Python):
import sys
sys.setrecursionlimit(10**9)
def input():
    return sys.stdin.readline().rstrip()

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


if __name__ == '__main__':
    main()

Solution (Python):
s = input()
l = len(s)
result = 0
n = 0
while n < l/2:
  if s[n] != s[(l-n)-1]:
    result += 1
    n += 1
  else:
    n += 1
print(result)

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

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

print(count)

Solution (Python):
S = input()

ret = 0

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

print(ret)

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

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

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

Solution (Python):
count = 0
line = list(input())

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

print(count)

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):
a = input()
 
count = 0
 
for i in range(len(a)//2):
    if a[i] is not a[-i-1]:
        count += 1
 
print(count)

Solution (Python):
a = input()

count = 0

for i in range(len(a)//2):
    if a[i] is not a[-i-1]:
        count += 1

print(count)

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

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

print(ans)

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

n = len(s)
if n % 2 == 0:
    s1 = [x for x in s[0:(int(n/2))]]
    s2 = [x for x in s[(int(n/2)):n]]
    
    

    num = 0
    for i in range(int(n/2)):
        
        
        if s1[i] != s2[int(n/2)-i-1]:
            num += 1
    print(num)
else:
    s1 = [x for x in s[0:(int((n-1)/2))]]
    s2 = [x for x in s[(int((n+1)/2)):n]]

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

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()
s_list = list(s)
n = len(s)
ans =0
for i in range(n-1):
    if s_list[i] != s_list[-1-i]:
        s_list[-1-i]=s_list[i]
        ans+=1
s2 = "".join(s_list)

print(ans)

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):
def main():
    l = input()
    givenLen = len(l)
    if l==l[::-1]:
        return 0

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

print(main())

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):
l=list(input())
c=0
n=len(l)
for i in range(n//2):
  if(l[i]!=l[n-i-1]):
    c+=1
print(c)

Solution (Python):
S = input()
l = len(S)
i = 0
hug = 0
while l/2 > i:
    if S[i] != S[l-1-i]:
        hug += 1
    i += 1
print(hug)

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

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

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

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 = input()
cnt = 0
for i in range(len(s)//2):
    if s[i] == s[len(s)-i-1]:
        pass
    else:
        cnt += 1
print(cnt)

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

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

print(count)

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

print(res)

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


def main():
    S = list(input().rstrip())
    cnt = 0
    for i in range(len(S) // 2):
        if S[i] != S[-i - 1]:
            cnt += 1
    print(cnt)


if __name__ == "__main__":
    main()

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

Solution (Python):
S = input()

rev_S = S[::-1]

count = 0
for s, r in zip(S, rev_S):
    if s != r:
        count += 1
print(count//2)

Solution (Python):
input = input()

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

Solution (Python):
input = input()

count = 0
s1 = ''
s2 = ''
if len(input) % 2 == 0:
  s1 = list(input[:len(input)//2])
  s2 = list(reversed(input[len(input)//2:]))
elif len(input) % 2 == 1:
  s1 = list(input[:len(input)//2])
  s2 = list(reversed(input[len(input)//2+1:]))

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

Solution (Python):
s = input()
length = len(s)
s_left = s[:length//2]
s_right = s[(length+1)//2:][::-1]
print(sum([x != y for x, y in zip(s_left, s_right)]))

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

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

cnt = 0

for i in range(0, len(s)//2):

    if s[i] != sr[i]:
        cnt += 1
    else:
        pass

print(cnt)

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

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

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

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

for a,b in zip(s[:len_s//2+1], s[:len_s//2-1:-1]):
  if a != b:
    count += 1
print(count)

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

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

Solution (Python):
a=input()

length=len(a)

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

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

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 = input()
print(len(list(filter(lambda x: x[0] != x[1], zip(a[:len(a)//2], a[:(len(a)-1)//2:-1])))))

Solution (Python):


s = input() 
n =len(s)

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


print(count)

Solution (Python):
def hug_counter(kaibun):
    global REQUIRED_HUG_COUNT
    if len(kaibun) < 1:
        return
    if kaibun[0] != kaibun[-1]:
        REQUIRED_HUG_COUNT += 1
    kaibun = kaibun[1:-1]
    hug_counter(kaibun)
        
REQUIRED_HUG_COUNT = 0
S = input()
hug_counter(S)
print(REQUIRED_HUG_COUNT)

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

Solution (Python):
s = input()
center = len(s) // 2
count = 0
for a, b in zip(s[:center], reversed(s[center:])):
  if a != b:
    count += 1
print(count)

Solution (Python):
word=input()
word_rev=word[::-1]
cnt=0

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

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

front =[]
rear =[]
mid = int(len(s)/2)
ans = 0

if(len(s)%2 == 0):
    for i in range(len(s)//2):
        a = s.pop(0)
        front.append(a)
    rear = s
    for i in range(len(front)):
        if(front[i] != rear[len(rear)-1-i]):
            ans += 1

else:
    dead = s.pop(mid)
    for i in range(len(s)//2):
        a = s.pop(0)
        front.append(a)
    rear = s
    for i in range(len(front)):
        if(front[i] != rear[len(rear)-1-i]):
            ans += 1
print(ans)

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

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

Solution (Python):
s = input()
mid = len(s)//2
ans = 0
s_ = []
for i in range(len(s)-1,mid-1,-1):
    s_ += s[i]
s_ = ''.join(map(str,s_))
for i in range(mid):
    if s_[i] != s[i]:
        ans += 1
print(ans)

Solution (Python):
s = input()

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

print(res)

Solution (Python):
import sys
sys.setrecursionlimit(10**6)

ii = lambda: int(input())
mis = lambda: map(int,input().split())
lmis = lambda: list(mis())
INF = float('inf')

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

if __name__ == "__main__":
    main()

Solution (Python):

import numpy as np

s = input()

len_s = len(s)
count = 0

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

print(count)

Solution (Python):
a = input()
b = list(a)
count = len(b)
count2 = count//2
n = 0
for i in range(count2):    
    if b[i] == b[count-i-1]:
        n = n
    else:
        n += 1

print(n)

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

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

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

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):
import math
S = str(input())
length = len(S)
 
count = 0
for i in range(math.floor(length/2)):
    if S[i] != S[length-i-1]:
        count += 1
        
if count < length/2:
    print(count)
else:
    print(math.floor(length/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()
num = int(len(s)/2)
count = 0

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

Solution (Python):
sen = input()

long = len(sen)
count = 0

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

print(count)

Solution (Python):
S = input()
count = 0
num = int(len(S)/2)

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


print(count)

Solution (Python):
S = input()
count = 0
num = int(len(S) / 2)


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

print(count)

Solution (Python):
from math import modf
word=input()
word=list(word)
n=len(word)/2
decimal,integer=modf(n)
integer=int(integer)
count=0
for i in range(integer):
  if word[i]!=word[-i-1]:
    word[-i-1]=word[i]
    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):


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

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

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

def get_reversed_str(s):
	return list(reversed(s))

reversed_s = get_reversed_str(s)

count = 0
if s != reversed_s:
	for i in range(len(s)):
		if s[i] != reversed_s[i]:
			s[i] = reversed_s[i]

			count += 1
			if s != get_reversed_str(s):
				continue
			else:
				break
print(count)

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

Solution (Python):
S = input()
print(sum(x != y for x, y in zip(S, S[::-1])) // 2)

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

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

print(c)

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

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 = list(input())
s_len=len(s)//2
s_r=s[::-1]
front=s[:s_len]
back=s_r[:s_len]

i=0
cou = 0
for a in front:
    if back[i] != a:
        back[i]=a
        cou += 1
    i+=1
print(cou)

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

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

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):
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()
k = 0

for i in range(0, len(S)):
    if S[i] != S[len(S)-i-1]:
        k = k+1

print(int(k/2))

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

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

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

print(ans)

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

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

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

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

Solution (Python):
str_list = list(input())
str_len = len(str_list)
hug = 0
for i in range(int(str_len/2)):
  if str_list[i] is not str_list[str_len - 1 - i]:
    hug += 1
print(hug)

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

cnt = 0

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

print(int(cnt / 2))

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):
a=input()
p=0
for i in range(len(a)):
    if i==len(a)-1-i:
        continue
    if a[i]!=a[len(a)-1-i]:
        p+=1
print(int(p/2))

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

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

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

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()
cnt = 0
while len(s) > 1:
  if s[0] != s[-1]:
    cnt += 1
  s = s[1:-1]
print(cnt)

Solution (Python):
S = input()


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

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

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

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

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

Solution (Python):
str=input()
rts=str[int(len(str)/2):]
str=str[:int(len(str)/2)]
if(len(str)!=len(rts)):
  rts=rts[1:]
rts=rts[::-1]
cnt=0
i=0
for e in str:
  if(rts[i]!=e):
    cnt+=1
  i+=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):
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    S=input()
    ans=0
    for s,t in zip(S,S[::-1]):
        ans+=s!=t

    print(ans//2)
resolve()

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

Solution (Python):
string = input()

length = len(string)
half = length // 2
if length % 2 == 0:
    left = string[:half]
    right = string[half:]
else:
    left = string[:half]
    right = string[half+1:]
assert len(left) == len(right)

diff = 0
for i in range(half):
    if left[i] != right[-1-i]:
        diff += 1
print(diff)

Solution (Python):
import sys

s = list(input())

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

print(i)

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

print(count)

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

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

Solution (Python):
S = input()
ret = 0
for idx, s in enumerate(reversed(S)):
    if S[idx] != s:
        ret += 1
print(ret // 2)

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

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

main()

Solution (Python):
import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    s = str(input().rstrip('\n'))
    cnt = 0
    for i in range(len(s)):
        if s[i] != s[-i-1]:
            cnt += 1
    print(cnt // 2)


if __name__ == '__main__':
    solve()

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

ret = 0

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

print(ret)

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

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

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

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

Solution (Python):
S = input()

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


print(cnt // 2)

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

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

print(ans)

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

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

Solution (Python):


s = str(input())
n = len(s)
counter = 0

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

print(counter)

Solution (Python):
word = input()
wordArray = list(word)

lent = len(wordArray)

iterV=(int)(lent/2)

if(lent%2==0):
 iterV=iterV+1


num=0

for i in range(iterV):
    
    
    if(wordArray[i] != wordArray[lent-1]):       
       wordArray[i]=wordArray[lent-1]      
       
       
       num=num+1       
    lent=lent-1



print(num)

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

A = input()

count = 0

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

print(count)

Solution (Python):
s = str(input())
cnt = 0
sle = len(s)
n = int(sle/2-1)
for a in range(n+1):
    if s[a] != s[sle-a-1]:
            s.replace(s[a],s[sle-a-1])
            cnt += 1
print(cnt)

Solution (Python):
s = str(input())
cnt = 0
sle = len(s)
n = int(sle/2-1)
for a in range(n+1):
    if s[a] != s[sle-a-1]:
            s.replace(s[a],s[sle-a-1])
            cnt += 1
print(cnt)

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

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

print(count)

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("")
i = 0
length = len(s)

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

Solution (Python):
s = input("")
i = 0
length = len(s)


count = 0
for i in range (0, length):
    if s[i] != s[length - i - 1]:
        count += 1

print(int(count / 2))

Solution (Python):
s = raw_input()
n = len(s)
i = 0
j = n-1
ans = 0
while(i<j):
    if(s[i]!=s[j]):
        ans+=1
    i+=1
    j-=1
print(ans)

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

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