{"raw_statement":[{"iden":"problem statement","content":"We will call a string that can be obtained by concatenating two equal strings an _even_ string. For example, `xyzxyz` and `aaaaaa` are even, while `ababab` and `xyzxy` are not.\nYou are given an even string $S$ consisting of lowercase English letters. Find the length of the longest even string that can be obtained by deleting one or more characters from the end of $S$. It is guaranteed that such a non-empty string exists for a given input."},{"iden":"constraints","content":"*   $2 \\leq |S| \\leq 200$\n*   $S$ is an even string consisting of lowercase English letters.\n*   There exists a non-empty even string that can be obtained by deleting one or more characters from the end of $S$."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$"},{"iden":"sample input 1","content":"abaababaab"},{"iden":"sample output 1","content":"6\n\n*   `abaababaab` itself is even, but we need to delete at least one character.\n*   `abaababaa` is not even.\n*   `abaababa` is not even.\n*   `abaabab` is not even.\n*   `abaaba` is even. Thus, we should print its length, $6$."},{"iden":"sample input 2","content":"xxxx"},{"iden":"sample output 2","content":"2\n\n*   `xxx` is not even.\n*   `xx` is even."},{"iden":"sample input 3","content":"abcabcabcabc"},{"iden":"sample output 3","content":"6\n\nThe longest even string that can be obtained is `abcabc`, whose length is $6$."},{"iden":"sample input 4","content":"akasakaakasakasakaakas"},{"iden":"sample output 4","content":"14\n\nThe longest even string that can be obtained is `akasakaakasaka`, whose length is $14$."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}