Codeforces Round #429 (Div. 2) 841B Godsend(签到题)

Posted 2020-10-03 #WoNderlAnd#

B. 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?

Input

First line of input data contains single integer n (1?≤?n?≤?10⁶) — length of the array.

Next line contains n integers a₁,?a₂,?...,?a_n (0?≤?a_i?≤?10⁹).

Output

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

Examples

Input

4
1 3 2 3

Output

First

Input

2
2 2

Output

Second

Note

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

---

 

依旧签到题……emmmm……谁会赢呢……第一个玩家只能取和为奇数的一组数，第二个玩家只能取和为偶数的，

①如果总和为奇数，肯定就First赢，毫无悬念

②如果总和为偶数，a.不包括奇数，全部是偶数的话，那么第一个玩家就没有任何可以取的机会了，Second赢

                              b.包括n个奇数，第一个玩家只需要取走所有的偶数外加n-1个奇数，那么第一个玩家取完以后只剩下1个奇数，First赢

（orz这种题也WA了两次额，第一次想的不够全面，第二次……竟然是因为数组开小了……敲黑板啊！数组开小RE这种掉分简直不能接受）

 1 #include<iostream>   
 2 using namespace std;
 3 typedef long long ll;
 4 ll a;
 5 int n, k,sum,count1,count2;
 6 int b[1000005];
 7 int main()
 8 {
 9     while (cin >> n )
10     {
11         sum = 0;
12         count1 = 0; count2 = 0;
13         for (int i = 0; i < n; i++)
14         {
15             cin >> a;
16             b[i] = a % 2;
17             sum += b[i];
18             if (b[i] % 2) count1++;
19             else count2++;
20         }
21         if (sum % 2) cout << "First" << endl;
22         else {
23             if (count1 > 0) cout << "First" << endl;
24             else cout << "Second" << endl;
25         }
26     }
27     return 0;
28 }