{"raw_statement":[{"iden":"problem statement","content":"A string $S$ of an odd length is said to be a _strong palindrome_ if and only if all of the following conditions are satisfied:\n\n*   $S$ is a palindrome.\n*   Let $N$ be the length of $S$. The string formed by the $1$\\-st through $((N-1)/2)$\\-th characters of $S$ is a palindrome.\n*   The string consisting of the $(N+3)/2$\\-st through $N$\\-th characters of $S$ is a palindrome.\n\nDetermine whether $S$ is a strong palindrome."},{"iden":"constraints","content":"*   $S$ consists of lowercase English letters.\n*   The length of $S$ is an odd number between $3$ and $99$ (inclusive)."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$"},{"iden":"sample input 1","content":"akasaka"},{"iden":"sample output 1","content":"Yes\n\n*   $S$ is `akasaka`.\n*   The string formed by the $1$\\-st through the $3$\\-rd characters is `aka`.\n*   The string formed by the $5$\\-th through the $7$\\-th characters is `aka`. All of these are palindromes, so $S$ is a strong palindrome."},{"iden":"sample input 2","content":"level"},{"iden":"sample output 2","content":"No"},{"iden":"sample input 3","content":"atcoder"},{"iden":"sample output 3","content":"No"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}