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: S = list(input())
  C = len(S)
  # print(S)
  # print(S[1])
  D = 0
  for n in range(C):
      if S[n] != S[C - n - 1]:
          D = D + 1
  print(round(D / 2))
  
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"}]