{"raw_statement":[{"iden":"problem statement","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?"},{"iden":"notes","content":"A **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`."},{"iden":"constraints","content":"*   $1 \\leq |S| \\leq 200$\n*   $S$ consists of lowercase English letters."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$"},{"iden":"sample input 1","content":"ababb"},{"iden":"sample output 1","content":"3\n\nThree palindromes `aba`, `bab`, `bb` can be chosen."},{"iden":"sample input 2","content":"xyz"},{"iden":"sample output 2","content":"3\n\nThree palindromes `x`, `y`, `z` can be chosen."},{"iden":"sample input 3","content":"xxxxxxxxxx"},{"iden":"sample output 3","content":"1"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}