We’re preparing your current view and syncing the latest data.
There is a pile with n sticks. Two players play a game alternately, where each player can remove either 1, 2, or 3 sticks from the pile during their turn. The player who cannot make a move (because the pile is empty on their turn) loses. Given the number of sticks n, determine which player (first or second) will win if both play optimally.
A single integer n (1 ≤ n ≤ 10^9) — the number of sticks in the pile.
Print "First" if the first player will win, or "Second" if the second player will win.
1 ≤ n ≤ 10^9
Example 1
Input
5
Output
First
Explanation
First player takes 1 stick, leaving 4 sticks for second player, who will lose if first plays optimally.