CF305E Playing with String

Two people play the following string game. Initially the players have got some string $ s $ . The players move in turns, the player who cannot make a move loses. Before the game began, the string is written on a piece of paper, one letter per cell. An example of the initial situation at $ s $ = "abacaba"A player's move is the sequence of actions: 1. The player chooses one of the available pieces of paper with some string written on it. Let's denote it is $ t $ . Note that initially, only one piece of paper is available. 2. The player chooses in the string $ t=t_{1}t_{2}...\ t_{|t|} $ character in position $ i $ $ (1

The first line contains string $ s $ ( $ 1

If the second player wins, print in the single line "Second" (without the quotes). Otherwise, print in the first line "First" (without the quotes), and in the second line print the minimal possible winning move — integer $ i $ $ (1

In the first sample the first player has multiple winning moves. But the minimum one is to cut the character in position $ 2 $ . In the second sample the first player has no available moves.