Consider the game for two players. Given a sequence of 0 and 1. At each turn a player must choose any two adjacent elements and to replace them in the sequence with one number - the result of the bitwise addition modulo 2 (XOR). The players take turns until there is one element left. If it will be 0 then wons the one who makes the move first, otherwise the second player wins. Determine the winner, provided that both play optimally.

Input

The first line contains an integer n (1 ≤ n ≤ 1000) - number of elements in the sequence. The second line contains the elements themselves - 0 and 1 separated by spaces.

Output

If the first player wins, print the word First, otherwise print Second.