24793번 - Shiritori 다국어

문제

The Japanese game of Shiritori is the perfect game for a long car ride. The rules are simple: the first player picks any word to say, then the second player must choose a new word that begins with the last letter of the word that the first player just said. Your job is to determine if the game was played according to these rules, given a history of the words used in a particular game. In a game, player 1ドル$ always starts first.

입력

Input consists of one test case that begins with an integer $N$ (2ドル \leq N \leq 100,000円$) on a single line. Each of the following $N$ lines contains 1ドル$ word. The words are presented in the order in which the players called them out, starting with player 1ドル$. All words consist of between 1ドル$ and 120ドル$ lowercase English letters.

출력

If the game was played according to the rules, output "Fair Game". Otherwise, find out which player first violated the rules of the game. That player lost the game, so output "Player <i> lost". For example, if player 1ドル$ violated the rules first, output "Player 1 lost".

제한

힌트