Taco Game Winner

Problem Statement:

Two players are playing the Taco Game. A string ( s ) consisting of only lowercase English letters is given. The players take turns removing exactly one character from the string. The player who removes the last character wins the game. Under optimal play, determine which player will win.

Observation:
Since every move reduces the length of ( s ) by 1, if the initial length ( n = |s| ) is odd, the first player will make the last move, whereas if ( n ) is even, the second player will do so.

inputFormat

The input consists of a single line containing the string ( s ) of lowercase English letters. It is guaranteed that ( 1 \leq |s| \leq 10^5 ).

outputFormat

Output a single line containing either "First" or "Second". Output "First" if the first player wins under optimal play, otherwise output "Second".## sample

aabb

Second