{"problem":{"name":"Palindrome-philia","description":{"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. Given is a string $S$. Fin","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc147_b"},"statements":[{"statement_type":"Markdown","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.\n\n## Constraints\n\n*   $S$ is a string consisting of lowercase English letters.\n*   The length of $S$ is between $1$ and $100$ (inclusive).\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$S$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc147_b","tags":[],"sample_group":[["redcoder","1\n\nFor example, we can change the fourth character to `o` and get a palindrome `redooder`."],["vvvvvv","0\n\nWe might need no hugs at all."],["abcdabc","2"]],"created_at":"2026-03-03 11:01:14"}}