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 = list(input())
  B = round(len(A) / 2)
  if len(A) % 2 != 0:
      A.pop(B - 1)
  R = 0
  C = A[0:B]
  D = A[-B:]
  D = D[::-1]
  count = 0
  for i in range(B - 1):
      if C[count] != D[count]:
          R += 1
      count += 1
  print(str(R))
  
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"}]