We’re preparing your current view and syncing the latest data.
There are two players playing a game involving plates. Initially, there are several plates arranged in a row, some facing up and some facing down. Players alternate turns, each picking one plate that is facing up and removing it from the row. After the last plate facing up is taken, the game ends and the player who cannot move loses. Given the initial states of the plates, determine which player will win the game if both play optimally.
The first line contains an integer n, the number of plates. The second line contains a string of length n consisting of '1's and '0's representing plate orientations (1 means facing up, 0 means facing down).
Print "First" if the first player will win, or "Second" otherwise.
1 <= n <= 50
Example 1
Input
3 101
Output
First
Explanation
There are two plates facing up. The first player picks one, then the second, then no plates are left for the first player. Since the count of plates facing up is odd, the first player wins.