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: 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)
  
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"}]