output_description: Print the minimum number of hugs needed to make S palindromic.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      S
attempt: a = input()
  a = list(a)
  b = len(a)
  c = b / 2
  d = []
  for i in range(0, c):
      d.append(a[i])
  e = a[::-1]
  f = []
  for g in range(0, c):
      f.append(e[g])
  answer = 0
  for h in range(0, c):
      if d[h] != f[h]:
          answer += 1
  print(answer)
  
problem_description: 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.
samples: [{"input": "redcoder", "output": "1\n    \n\nFor example, we can change the fourth character to `o` and get a palindrome\n`redooder`.\n\n* * *"}, {"input": "vvvvvv", "output": "0\n    \n\nWe might need no hugs at all.\n\n* * *"}, {"input": "abcdabc", "output": "2"}]