{"raw_statement":[{"iden":"problem statement","content":"You are given a string $S$. Find the maximum length of a contiguous substring of $S$ that is a palindrome.  \nNote that there is always a contiguous substring of $S$ that is a palindrome."},{"iden":"constraints","content":"*   $S$ is a string of length between $2$ and $100$, inclusive, consisting of uppercase English letters."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$S$"},{"iden":"sample input 1","content":"TOYOTA"},{"iden":"sample output 1","content":"5\n\n`TOYOT`, a contiguous substring of `TOYOTA`, is a palindrome of length $5$.  \n`TOYOTA`, the only length-$6$ contiguous substring of `TOYOTA`, is not a palindrome, so print $5$."},{"iden":"sample input 2","content":"ABCDEFG"},{"iden":"sample output 2","content":"1\n\nEvery contiguous substring of length $1$ is a palindrome."},{"iden":"sample input 3","content":"AAAAAAAAAA"},{"iden":"sample output 3","content":"10"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}