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: import sys
  
  S = input()
  Skai = list(S)
  Skai.reverse()
  S = list(S)
  num = len(S)
  i = 0
  Slist = []
  Skailist = []
  for j in range(num):
      if S[j] != Skai[j]:
          i += 1
          Skailist.append(Skai[j])
          Slist.append(S[j])
          if Slist == Skailist:
              print(len(Skailist))
              sys.exit()
  print(int(i / 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"}]