Nim Game - Give Away!

Time limit: 3 seconds.

You are to determine the status of a position in Inversed Nim Game, that has the following rules.

There are four stone piles with n₁, n₂, n₃, n₄ stones. One is permitted to take any number of stones from one pile for a move. The one who takes the last stone(s) LOOSES.

Input consists of four integers n_i, each less than 2^30.

Output either the string "First wins." or the string "Second wins." (without quotes).

SAMPLE INPUT #1:

1 0 0 0

SAMPLE OUTPUT #1

Second wins. 

SAMPLE INPUT #2:

3 2 1 0

SAMPLE OUTPUT #2

Second wins. 

Authors:
Voroztsov Artem

<PREV | Problem set | Search related messages | NEXT>