Complex XOR Game#2025

Complex XOR Game

1 second

128 megabytes

Very easy

Consider the following game for two players. On the board, the numbers from $0$ to $N - 1$ N - 1 are written. The first player chooses a number, then the second player chooses a different number, after which both of these numbers are removed from the board. If there is a number on the board equal to the result of the bitwise XOR operation of these two numbers, it is also removed. Then the first player makes the next move, and so on. A player who cannot choose a number loses the game.

Input

The only input line contains the number $N$ ( $1 \leq N \leq 32$ 1 \leq N \leq 32).

Output

Print First if the first player wins; otherwise, print Second.

Examples

Example 1

Loading

N - 1

1 \leq N \leq 32