841B.md (1299B)
1 Source: https://codeforces.com/problemset/problem/841/B 2 3 B. Godsend 4 5 time limit per test 6 7 2 seconds 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 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? 22 23 Input 24 25 First line of input data contains single integer *n* (1 ≤ *n* ≤ 106) — length of the array. 26 27 Next line contains *n* integers *a*1, *a*2, ..., *a**n* (0 ≤ *a**i* ≤ 109). 28 29 Output 30 31 Output answer in single line. "First", if first player wins, and "Second" otherwise (without quotes). 32 33 Examples 34 35 Input 36 37 ``` 38 4 39 1 3 2 3 40 ``` 41 42 Output 43 44 ``` 45 First 46 ``` 47 48 Input 49 50 ``` 51 2 52 2 2 53 ``` 54 55 Output 56 57 ``` 58 Second 59 ``` 60 61 Note 62 63 In first sample first player remove whole array in one move and win. 64 65 In second sample first player can't make a move and lose.