Game
Two players are engaged in a game involving N piles of stones. Each pile i initially contains n_i stones and is associated with two natural numbers, x_i and y_i. The players alternate turns. During a turn, a player selects a pile i and removes either x_i or y_i stones from it, provided the pile has at least that many stones. The player who cannot make a move loses the game. Your task is to determine the winner, assuming both players play optimally: will it be the first player or the second player?
Input
The first line of the input contains a natural number N ≤ 10000. The following N lines each contain three numbers. Specifically, the i-th line provides the parameters for the i-th pile: n_i, x_i, y_i. Here, 1 ≤ n_i, x_i, y_i ≤ 10^18.
Output
Print "First" (without quotes) on a single line if the first player wins, and "Second" (without quotes) if the second player wins.