{"problem":{"name":"String Palindrome","description":{"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: *   $S$ is a palindrome. *   Let $N$ be the length of $S$. The string f","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc159_b"},"statements":[{"statement_type":"Markdown","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.\n\n## Constraints\n\n*   $S$ consists of lowercase English letters.\n*   The length of $S$ is an odd number between $3$ and $99$ (inclusive).\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$S$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc159_b","tags":[],"sample_group":[["akasaka","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."],["level","No"],["atcoder","No"]],"created_at":"2026-03-03 11:01:14"}}