Complex game XOR

Consider the following game for two players. Written on the blackboard N numbers from 0 to N-1. The first player chooses a number, then the second player chooses a different number, then both of these numbers are erased from the board. Since the board is erased and the number if it is equal to the bitwise XOR operation of these two numbers. Then again, the first player makes his move, etc. Losing someone who can not pick a number.

For a given number N to determine who will win - the one who goes first or who goes second, provided that both players play optimally.

Input

The only number N (1 ≤ N ≤ 32).

Output

Need to get the word First, if a player wins, are first to act, otherwise get the word out Second.

Examples