{"raw_statement":[{"iden":"problem statement","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."},{"iden":"constraints","content":"*   $3 ≤ |s| ≤ 10^5$\n*   $s$ consists of lowercase English letters.\n*   No two neighboring characters in $s$ are equal."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$s$"},{"iden":"sample input 1","content":"aba"},{"iden":"sample output 1","content":"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."},{"iden":"sample input 2","content":"abc"},{"iden":"sample output 2","content":"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."},{"iden":"sample input 3","content":"abcab"},{"iden":"sample output 3","content":"First"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}