Game#1900
Two players take turns playing a game with piles of stones. Each pile initially contains n_i stones and is associated with two natural numbers x_i and y_i. On each turn, a player chooses a pile and removes either x_i or y_i stones from it, provided the pile has at least as many stones as the chosen amount. A player who cannot make a move loses. Determine who wins if both play optimally: the first player or the second player.
The first line contains a natural number N \leq 10000. The following lines each contain three numbers, describing the parameters of the -th pile: n_i, x_i, y_i. Here, 1 \leq n_i, x_i, y_i \leq 10^{18}.
Print "First" (without quotes) if the first player wins, or "Second" (without quotes) if the second player wins.
Example 1