Two players play the following game. On the table, there are two stacks of coins. Players take turns. On each turn, a player may take any non-zero number of coins from any one stack, or take the same non-zero number of coins from both stacks at once. The player who cannot make a move loses.
The initial number of coins in each stack is given. Determine who will win if both play optimally.
The only line of input contains integers C_1 and C_2 (1 \leq C_1, C_2 \leq 7^{77}), the number of coins in the stacks.
Print First if the first player wins, or Second if the second player wins.
Example 1