<PREV Problem:
NEXT>
Solved by 302 users: ...
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 

Camomile Game -- who is the winner?

Time limit = 5 seconds

The Camomile Game has following rules. Camomile is a flower with N petals.

Two playes make their moves in turn. For a move a player can pull out any petal or two petals growing side by side.

The player who can't make move looses.

It's easy to find out that the second player has winning strategy for N > 2.

We have M camomiles each with one petal pulled out. Your program should determine who has winning strategy in this game.

Input The number of camomiles M, 1 ≤ M ≤ 10 folowed by M lines with numbers of petals on camomiles Ni ( Ni < 200 ).

Output Line with "First wins." or "Second wins.".

Input#1
1
10
Output#1
First wins.
Input#2
2
10
10
Output#2
Second wins.
Input#3
3
6
7
8
Output#3
Second wins.

Author:
Voroztsov Artem

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


© acm.mipt DevGroup
The page was generated in 180ms

SW soft NIX
ID = 54.80.60.91