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: Y = str(input())  # 1行に沢山の数値(または文字)が並んでいる場合にリストに格納していく
  X = []
  X = list(Y)  # 数値YをリストXに格納
  print(X)
  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))
  
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"}]