Polygon Game
Two players are engaged in a strategic game involving a set of N convex polygons. The game proceeds as follows: the first player selects one polygon and draws a line through any internal point, dividing it into two smaller polygons. The division must ensure that neither of the resulting polygons has more vertices than the original. The second player then chooses which of the two resulting polygons to keep and which to discard. This completes the first move.
In the subsequent move, the second player cuts one of the remaining polygons into two parts, and the first player decides which part to retain. The game alternates turns in this manner. The game concludes when a player is unable to make a move, which occurs when all polygons have been reduced to triangles. The player unable to make a move loses the game.
Your task is to determine the winner, assuming both players employ optimal strategies.
Input
The input begins with an integer N (1 ≤ N ≤ 10000), representing the number of polygons. The second line contains N integers, each ranging from 3 to 4000, indicating the number of vertices in each polygon.
Output
Print "First" if the first player is guaranteed to win with optimal play, or "Second" if the second player will win.