{"raw_statement":[{"iden":"problem statement","content":"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.\nGiven is a string $S$. Find the minimum number of hugs needed to make $S$ palindromic."},{"iden":"constraints","content":"*   $S$ is a string consisting of lowercase English letters.\n*   The length of $S$ is between $1$ and $100$ (inclusive)."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$"},{"iden":"sample input 1","content":"redcoder"},{"iden":"sample output 1","content":"1\n\nFor example, we can change the fourth character to `o` and get a palindrome `redooder`."},{"iden":"sample input 2","content":"vvvvvv"},{"iden":"sample output 2","content":"0\n\nWe might need no hugs at all."},{"iden":"sample input 3","content":"abcdabc"},{"iden":"sample output 3","content":"2"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}