El Judge

Online MIPT programming contest | РУССКИЙ |

<PREV Problem: | NEXT> |

` < ` |
---|

Time limit = 5 seconds

The Camomile Game has following rules. Camomile is a flower withTwo 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 *N _{i}* (

**Output**
Line with "`First wins.`

" or "`Second wins.`

"*.*

Input#11 10 |
Output#1First wins. |

Input#22 10 10 |
Output#2Second wins. |

Input#33 6 7 8 |
Output#3Second wins. |

**Author:
Voroztsov Artem
**

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

© acm.mipt DevGroup The page was generated in 200ms |