A11125. Godsend

Leha somehow found an array consisting of $n$ integers. Looking at it, he came up with a task. Two players play the game on the array. Players move one by one. The first player can choose for his move a subsegment of non-zero length with an odd sum of numbers and remove it from the array, after that the remaining parts are glued together into one array and the game continues. The second player can choose a subsegment of non-zero length with an even sum and remove it. Loses the one who can not make a move. Who will win if both play optimally?

First line of input data contains single integer $n$ ( $1<=n<=10^{6}$ ) — length of the array.

Next line contains $n$ integers $a_{1},a_{2},...,a_{n}$ ( $0<=a_{i}<=10^{9}$ ).

Output answer in single line. "First", if first player wins, and "Second" otherwise (without quotes).

In first sample first player remove whole array in one move and win.

In second sample first player can't make a move and lose.