CF841B.Godsend

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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).

输入输出样例

输入#1
```
4
1 3 2 3
```
输出#1
```
First
```
输入#2
```
2
2 2
```
输出#2
```
Second
```

说明/提示

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.

首页