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()
count = 0
first_half, second_half = s[:len(s)//2], s[(len(s)+1)//2:]
if first_half == reversed(second_half):
    print(count)
else:
    for x in range(len(first_half)):
        if first_half[x] != second_half[len(second_half)-x-1]:
            count += 1
    print(count)

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

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


count = 0
for j in range(0, len(s)):
    if s[j] != s_[j]:
        count += 1
print('{:.0f}'.format(count/2))

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

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

print(ans)

Solution (Python):

s=list(input())
n=len(s)
c=0

if n%2 == 0:
  m=int(n/2)
else:
  m=int((n-1)/2)

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

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

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

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

print(c)

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

ans=0

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

print(ans)

Solution (Python):
N = input()

a=0
l=len(N)

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

Solution (Python):
str = input()
chars = list(str)
input_len = len(chars)

count = 0
if input_len % 2 == 0:
  mid = input_len//2
  s1 = chars[0:mid]
  s2 = chars[mid:input_len]
  for x, y in zip(s1,s2[::-1]):
    if x != y:
      count += 1

else:
  mid = (input_len//2) + 1
  s1 = chars[0:mid-1]
  s2 = chars[mid:input_len]
  for x, y in zip(s1,s2[::-1]):
    if x != y:
      count += 1
print(count)

Solution (Python):
s = input()

print(sum(map(lambda i: 1 if s[i] != s[-(i+1)] else 0, range(len(s) // 2))))

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

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

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

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

n = len(a)//2
cnt = 0

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

Solution (Python):
S = input()
S_rev = S[::-1]
count=0

for i,j in zip(S, S_rev):
    if not i==j:
        count += 1

print(count//2)

Solution (Python):
import math
def is_palindrome(string):
    if string == string[::-1]:
        return True
    else:
        return False

string = input()
num = 0



if is_palindrome(string):

    print(num)



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

            continue
        else:
            str_list = list(string)
            str_list[i]=str_list[-(i+1)]
            num +=1
    print(num)

Solution (Python):
from math import floor
s = input()

len_s = len(s)
len_s_d2 = floor(len(s) / 2)
cnt_hug = 0
for i in range(len_s_d2):
	if s == s[::-1]:
		break
	if s[i] != s[len_s - 1 - i]:
		if i == 0:
			s = s[len_s - 1] + s[1:]
		else:
			s = s[:i] + s[len_s - 1 - i] + s[i+1:]
		cnt_hug += 1

print(cnt_hug)

Solution (Python):
s=input()
l,r=0,len(s)-1
a=0
while l<r:
    if s[l]!=s[r]: a+=1
    l+=1
    r-=1
print(a)

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

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

Solution (Python):
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
s=input()
l=len(s)
count=0



if l%2==0:
    for i in range(0,int(l/2)):
        if s[i]!=s[(l-1)-i]:
            
            
           
            
            count+=1
        else:
            
            
            
            
            
            pass
            
else:
    N=Decimal(str(l/2)).quantize(Decimal('0'), rounding=ROUND_HALF_UP)
    for i in range(0,int(N)):
        if s[i]!=s[(l-1)-i]:
            
            
            
            
            count+=1
            
        else:
            
            
            
            
            pass



print(count)

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

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

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

length = len(S)

ans = 0

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

print(ans)

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

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

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

Solution (Python):






from sys import stdin,setrecursionlimit










setrecursionlimit(10**6)
input=stdin.readline

s=input().rstrip()
l,r=0,len(s)-1
ans=0
while l<r:
    if s[l]!=s[r]: ans+=1
    l+=1
    r-=1
print(ans)

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

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

print(sum)

Solution (Python):
s = str(input())
k = 0

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

Solution (Python):
S = input()

num = len(S)

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

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

    print(count)

Solution (Python):
s = input()
if((len(s) >= 1)and(len(s) <= 100)):
  ls1 = []
  ls2 = []
  count = 0
  for char in s:
    ls1.append(char)
  ls2 = ls1.copy()
  ls1.reverse()
  for i in range(int(len(ls2)/2)):
    if (ls1[i] != ls2[i]):
      count += 1
  print(count)

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

Solution (Python):
counter = 0
text = input()
if len(text) % 2 != 0:
    left = int(len(text)/2) + 1
    right = len(text) - int(len(text)/2)-1
else:
    left = int(len(text)/2)
    right = len(text) - int(len(text)/2)
left_p = text[:right]
right_p = text[left:]
for i in range(0, len(left_p)):
    if (left_p[i] != right_p[len(right_p)-i-1]):
        counter += 1
print(counter)

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

Solution (Python):



import sys
read = sys.stdin.read
readline = sys.stdin.readline 
readlines = sys.stdin.readlines




s = input()

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

print(ans//2)

Solution (Python):
a= input().strip()
l = int(len(a) //2 )
if len(a) % 2 != 0:
  l += 1
l2 = int(len(a))
k1 = list(a[0:l])
k2 = list(a[l:l2])

k2.reverse()

ans = 0
idx = 0
for i in k2:
  if k1[idx] != k2[idx]:
    ans +=1
  idx +=1
print(ans)

Solution (Python):
a = input()
b = list(a)
c = list(a[::-1])
if b == c:
    print(0)
else:
    d = len(a)
    count = 0
    for i in range(0,d):
        if b[i] != c[i]:
            count += 1
        else:
            pass
    print(int(count/2))

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

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

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

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

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

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

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

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

Solution (Python):
n = input()
n = list(n)
m = len(n) 
A = 0
if m % 2 == 0:
    K = int(m/2)
    a = n[0:K]
    n.reverse()
    b = n[0:K]
else:
    K = int((m - 1) / 2)
    a = n[0:K]
    n.reverse()
    b = n[0:K]
for i, value in enumerate(a):
    if value != b[i]:
        A = A + 1

print(A)

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

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

cou = 0
for i in range(len(S)):
    if S[i] != rev_S[i]:
        cou += 1

print(cou//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()

max_ans = len(S) // 2
ans = 0

for i in range(max_ans):
  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[len(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):
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):
string = list(input())
length = len(string)
l = list()
if length % 2 ==0:
    for i in range (int(length/2),length):
        l.append(string[i])
    l.reverse()
else:
    for i in range (int(length/2)+1,length):
        l.append(string[i])
    l.reverse()
result = 0
for i in range(len(l)):
    if not l[i] == string[i]:
        result = result + 1
print(result)

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

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

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
 
S=input().rstrip()
R=list(S)
R.reverse()
R = "".join(R)
l = int(len(S)/2)
rtn=0
for i in range(l):
  if S[i]!=R[i]:
    rtn+=1
print(rtn)

Solution (Python):
s = input()
cnt = 0
if len(s) % 2 == 1:
    half = (len(s)-1)//2
else:
    half = len(s)//2
l1 = list(s[:half])
l2 = list(reversed(s[-half:]))
for i in range(len(l1)):
    if l1[i] != l2[i]:
        cnt += 1
print(cnt)

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

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

print(diff)

Solution (Python):
import sys

s = input()
if len(s) == 1:
    print(0)
    sys.exit(0)

sb = s[:len(s)//2]
if len(s) % 2 == 1:
    sa = s[len(s)//2+1:]
else:
    sa = s[len(s)//2:]
sa = sa[::-1]

cnt = 0
for i,b in enumerate(sb):
    if b != sa[i]:
        cnt += 1
print(cnt)

Solution (Python):
text = input()
if (len(text) % 2 != 0):
    left = int(len(text)/2) + 1
    right = len(text) - int(len(text)/2)-1
else:
    left = int(len(text)/2)
    right = len(text) - int(len(text)/2)

score = 0

left_part = text[:right]
right_part = text[left:]

for i in range(0, len(left_part)):
    if (left_part[i] != right_part[len(right_part)-i-1]):
        score += 1

print(score)

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

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

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

Solution (Python):
import math

S = input()
flag=0
for i in range(math.ceil(len(S)//2)):
  if S[i]!=S[-i-1]:
    
    flag+=1
print(flag)

Solution (Python):
s = input()
string = list()
for letter in s:
	string.append(letter)

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

Solution (Python):
S = list(input())
cnt = 0
for i in range(len(S)):
    
    if S[i] != S[-(i+1)]:
        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] is not s[-i-1]:
        c += 1

print(c)

Solution (Python):

import math
S = input()
s = list(S) 
count=0
N=int(math.ceil(len(s)/2))

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

print(count)

Solution (Python):
from sys import stdin


def fetch_one_line():
    return stdin.readline().rstrip()


def fetch_int_input():
    return [int(s) for s in fetch_one_line().split()]


def fetch_inputs(times):
    return [fetch_one_line() for _ in range(times)]


def fetch_int_inputs(times):
    return [[int(s) for s in fetch_one_line()] for _ in range(times)]


rotate_candidate = fetch_one_line()
half_len = int(len(rotate_candidate) / 2)

hug_num = 0
for i in range(half_len):
    if rotate_candidate[i] != rotate_candidate[-(i+1)]:
        hug_num += 1

print(hug_num)

Solution (Python):
alpha = str(input())
beta = alpha[::-1]

x = 0
for i in range(len(alpha)):
    if alpha[i] != beta[i]:
        x += 1
print(x//2)

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

a = s[::-1]

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

print(ans//2)

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

s1 = list(s[0:int(len(s) / 2 + 0.5)])
s2 = list(s[int(len(s) / 2):len(s)])

s2.reverse()

count = 0

for i in range(int(len(s) / 2+0.5)):
   if s1[i] != s2[i]:
      count += 1

print(count)

Solution (Python):
s = list(map(str, input()))

import math
if len(s)%2 == 0:
    c = math.floor(len(s)/2)
    l = s[0:c]
    r = list(reversed(s[c:len(s)]))
elif len(s)%2 == 1:
    c = math.floor((len(s))/2)
    l = s[0:c]
    r = list(reversed(s[c+1:len(s)]))
    
count = 0
for i in range(len(l)):
    if l[i] != r[i]:
        count += 1
    else:
        continue
        
print(count)

Solution (Python):


from math import ceil,floor









S = input()

ans = 0

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

print(ans)

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

if len(s)%2 == 0:
  a = s[:len(s)//2]
  b = s[len(s)//2:]
else:
  a = s[:len(s)//2]
  
  b = s[(len(s)//2)+1:]
  
cnt = 0
for i,j in zip(a,b[::-1]):
  if i!=j:
    cnt += 1
  
print(cnt)

Solution (Python):
S = list(input())
tem = int(len(S)/2)

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

print(counter)

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

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

for i, c in enumerate(s):
    if i > int(len(s) / 2) - 1:
        break
    if c != s[-i - 1]:
        count += 1
print(count)

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

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()
length = len(S)

if length % 2 == 0:
    half = length//2
    mae = S[0:half]
    ushiro = S[half:]
else:
    half = (length)//2
    mae = S[0:half]
    ushiro = S[half+1:]
count = 0
for (s1,s2) in zip(mae,ushiro[::-1]):
    if not s1 == s2:
        count += 1
print(count)

Solution (Python):
str = input()
size = len(str)
cnt = 0
i = 0

for i in range(int(size/2)):
    if str[i] != str[size-1-i]:
        cnt = cnt+1



print(cnt)

Solution (Python):
S = input()

if len(S) % 2 == 0:
    m = int(len(S) / 2)
else: 
    m = int(len(S) / 2) + 1

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

print(ans)

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

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):
import sys
sys.setrecursionlimit(10**6)
if sys.platform in (['ios','darwin','win32']):
	sys.stdin=open('Untitled.txt')
input = sys.stdin.readline
def INT(): return int(input())
def MAP(): return [int(s) for s in input().split()]

S = input().rstrip()
n = len(S)//2 if not len(S)%2 else len(S)//2+1
L = len(S)

cnt = 0
for i in range(n):
	
	
	
	if i == L-i-1: continue
	if S[i]==S[L-i-1]: continue
	else: cnt+=1

print(cnt)

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

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

Solution (Python):
a = input()
m = len(a)
if m % 2 == 0:
  ind = int(m/2)
else:
  ind = int((m-1)/2)

a1 = a[:ind]
a2 = a[-ind:][::-1]

ans = len(list(filter(lambda x: x[0] != x[1], zip(a1, a2))))

print(ans)

Solution (Python):
S=input()
N=len(S)
counter=0
if N %2 ==0:
    half = int(N/2)
elif N%2==1:
    half = int((N-1)/2)

for i in range(half):
    if S[i]==S[-i-1]:
        pass
    else:
        counter= counter+1
print(counter)

Solution (Python):
def palin(S):
    lst = list(S)
    num = len(lst)//2
    count = 0
    for i in range(num):
        if not lst[i] == lst[-i-1]:
            count += 1
    return count

S = input()
print(palin(S))

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

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

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

Solution (Python):
S = input()

lS = len(S)
if lS % 2 == 0:
    mind = int(lS/2)
    maeS = S[:mind]
    atS = S[mind:]

else:
    mind = int(lS//2)
    maeS = S[:mind]
    atS = S[mind+1:]



revatS = atS[::-1]
count = 0

for i in range(len(maeS)):

    if maeS[i] != revatS[i]:
        count += 1

print(count)

Solution (Python):
import math

S = input()
l = len(S)
count = 0

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

print(count)

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

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

print(cnt // 2)

Solution (Python):
bun = input()
i = 0
hug = 0
while i < int(len(bun)/2):
  if bun[i] == bun[len(bun)-i-1]:
    i += 1
  else:
    hug += 1
    i += 1
print(hug)

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

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

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

Solution (Python):
validate_list, s = list(), list(input())
validate_list = [s[i] == s[-i - 1] for i in range(len(s))]
print(int(validate_list.count(False)/2))

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

Solution (Python):
S =input().strip()

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

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

    check_str_list = []
    chesk_str_list_reverse = []
    rev_cnt = 0

    for i in range(len(s) // 2):
        check_str_list.append(s[i])
        rev_cnt -= 1
        chesk_str_list_reverse.append(s[rev_cnt])

    result = 0

    for i in range(len(check_str_list)):
        if check_str_list[i] != chesk_str_list_reverse[i]:
            result += 1

    print(result)
if __name__ == '__main__':
    abc147_b()

Solution (Python):
s = list(input())
n = len(s)
res = 0

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

print(res)

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
first_half, second_half = s[:len(s)//2], s[(len(s)+1)//2:]
if first_half == reversed(second_half):
    print(count)
else:
    for x in range(len(first_half)):
        if first_half[x] != second_half[len(second_half)-x-1]:
            count += 1
    print(count)

Solution (Python):
S = input()

T = S[::-1]

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

print(ans // 2)

Solution (Python):

S=str(input())
N=len(S)
k=0
for i in range(0,N//2,1):
    if S[i]!=S[N-1-i]:
        k+=1
print (k)

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

print(b//2 + b%2)

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

count = 0

l=[]

l = list(S)

a = len(l)

b = a - 1

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

count = count/2

print(int(count))

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

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

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

sb = len(S) // 2
fs = S[:sb]
bs = S[-sb:]

if fs == bs[::-1]:
  cnt = 0
else:
  for i in range(len(fs)):
    if fs[i:i+1] != bs[::-1][i:i+1]:
      cnt += 1
      
print(cnt)

Solution (Python):
s = input()
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 = s2[::-1]
num=0
for i in range(len(s1)):
    if s1[i]!=s2[i]:
        num+=1
print(num)

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

Solution (Python):
s = input()
ans = 0
l, r = 0, len(s)-1
while l < r:
    if s[l] != s[r]:
        ans += 1
    l += 1
    r -= 1
print(ans)

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

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

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

count=0

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

print(count)

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

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

Solution (Python):

S = list(input())
N = len(S)

p = 0 
o = 0 
u = N 


if N % 2 == 0:
    
    for i in range(int(N/2)):
        if S[p] == S[u-1]:
            
            p += 1
            u -= 1
        else:
            
            o += 1
            p += 1
            u -= 1
else:
    N -= 1
    
    for i in range(int(N/2)):
        if S[p] == S[u-1]:
            
            p += 1
            u -= 1
        else:
            
            o += 1            
            p += 1
            u -= 1
print(o)

Solution (Python):
a = input()
length = len(a)

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

Solution (Python):
def main():
  S = input()
  half = int(len(S) / 2) if len(S) % 2 == 0 else int((len(S) - 1) / 2)
  first = []
  latter = []
  count = 0

  for i in range(half):
    first.append(S[i])
    latter.append(S[-i-1])

  for i in range(half):
    count += 0 if first[i] == latter[i] else 1

  print(count)
  

if __name__ == '__main__':
  main()

Solution (Python):
s = input()

size = len(s)

ans = 0

for i in range(size // 2):
    if s[i] == s[-i-1]:
        continue
    else:
        ans += 1

print(ans)

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

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()
res_first = S[0:len(S) // 2]
res_second = S[len(S) // 2 if len(S) % 2 == 0
               else ((len(S) // 2) + 1):]
count = 0

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

print(count)

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

Solution (Python):
if __name__ == "__main__":
    input_data = input('')
    count = 0
    length = len(input_data)
    for i in range(int(length/2)):
        if not input_data[i] == input_data[length-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()
print(len([0 for i in range(len(S) // 2) if S[i] != S[-i-1]]))

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

print(count)

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

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

Solution (Python):
S = input()

S_length = len(S)

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

Solution (Python):
import math

def countHugs(input_string):
  string_arr = [char for char in input_string]
  hugs = 0
  for r in range(0, (math.ceil(len(string_arr)/2))):
    pointerA = string_arr[r]
    pointerB = string_arr[-(r+1)]
    if pointerA != pointerB:
      hugs += 1
  print(hugs)

if __name__ == "__main__":
    input_string = input()
    countHugs(input_string)

Solution (Python):
s = list(map(str,input()))


n = int(len(s))
m = int(len(s))-1
l = int(n/2)


ans = int(0)

for i in range(l):
    if s[i] == s[m-i]:
        continue
    else:
        ans += 1


print(ans)

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

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

Solution (Python):
S = input()

length = len(S)

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

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