{"problem":{"name":"An Ordinary Game","description":{"content":"There is a string $s$ of length $3$ or greater. No two neighboring characters in $s$ are equal. Takahashi and Aoki will play a game against each other. The two players alternately performs the followi","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc064_b"},"statements":[{"statement_type":"Markdown","content":"There is a string $s$ of length $3$ or greater. No two neighboring characters in $s$ are equal.\nTakahashi and Aoki will play a game against each other. The two players alternately performs the following operation, Takahashi going first:\n\n*   Remove one of the characters in $s$, excluding both ends. However, a character cannot be removed if removal of the character would result in two neighboring equal characters in $s$.\n\nThe player who becomes unable to perform the operation, loses the game. Determine which player will win when the two play optimally.\n\n## Constraints\n\n*   $3 ≤ |s| ≤ 10^5$\n*   $s$ consists of lowercase English letters.\n*   No two neighboring characters in $s$ are equal.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$s$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc064_b","tags":[],"sample_group":[["aba","Second\n\nTakahashi, who goes first, cannot perform the operation, since removal of the `b`, which is the only character not at either ends of $s$, would result in $s$ becoming `aa`, with two `a`s neighboring."],["abc","First\n\nWhen Takahashi removes `b` from $s$, it becomes `ac`. Then, Aoki cannot perform the operation, since there is no character in $s$, excluding both ends."],["abcab","First"]],"created_at":"2026-03-03 11:01:14"}}