Problem
Given a game for two players with strings.
Given a set consisting of n non-empty strings. During the game, two players build a word together, initially this word is empty. The players take turns. During his turn, the player must add one letter to the end of the word so that the resulting word is a prefix of at least one line from the given set. The one who cannot make a move loses.
Given a set of strings, determine who will be the winner if both players play optimally.
Input:
The first line contains the integer n (1 ≤ n ≤ 10
5).
Each of the next n lines contains a non-empty string from the given set. The total length of all strings from the set does not exceed 10
5. All strings from the set consist only of lowercase Latin letters.
Output:
If the player who moves first wins, then print "First", otherwise print "Second" (no need to print quotes).
Examples:
| Input |
Output |
3
a
b
c |
First |
1
ab |
Second |