Game XOR#2015
Consider a game for two players. You are given a sequence consisting of s and s. On each turn, a player selects any two adjacent elements and replaces them with a single number — the result of their bitwise addition modulo (). The players take turns, and the game continues until only one element remains.
Determine which player will win with optimal play from both players.
The first line contains an integer (1 \leq n \leq 1000) — the number of elements in the sequence.
The second line contains the elements themselves: or , separated by spaces.
If the first player wins, print First. Otherwise, print Second.
Example 1