{"problem":{"name":"Ex - Hakata","description":{"content":"We have a string $S$ consisting of lowercase English letters.   Bob just thinks about palindromes every day. He decided to choose some of the substrings of $S$ that are palindromes and tell them to An","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc237_h"},"statements":[{"statement_type":"Markdown","content":"We have a string $S$ consisting of lowercase English letters.  \nBob just thinks about palindromes every day. He decided to choose some of the substrings of $S$ that are palindromes and tell them to Anna.\nAnna gets angry if one of the palindromes told by Bob is a substring of another.\nHow many palindromes can Bob choose while not making Anna angry?\n\n## Constraints\n\n*   $1 \\leq |S| \\leq 200$\n*   $S$ consists of lowercase English letters.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$S$\n\n[samples]\n\n## Notes\n\nA **substring** of $S$ is the result of deleting zero or more characters from the beginning and the end of $S$.  \nFor example, `ab` is a substring of `abc`, while `ac` is not a substring of `abc`.","is_translate":false,"language":"English"}],"meta":{"iden":"abc237_h","tags":[],"sample_group":[["ababb","3\n\nThree palindromes `aba`, `bab`, `bb` can be chosen."],["xyz","3\n\nThree palindromes `x`, `y`, `z` can be chosen."],["xxxxxxxxxx","1"]],"created_at":"2026-03-03 11:01:13"}}