Once Petya and Vasya invented a new game and called it "Smart Boy". They located a certain set of words -- the dictionary -- for the game. It is admissible for the dictionary to contain similar words. The rules of the game are as follows: first the first player chooses any letter (a word as long as 1) from any word from the dictionary and writes it down on a piece of paper. The second player adds some other letter to this one 's initial or final position, thus making a word as long as 2, then it 's the first player 's turn again, he adds a letter in the beginning or in the end thus making a word as long as 3 and so on. But the player mustn 't break one condition: the newly created word must be a substring of a word from a dictionary. The player who can 't add a letter to the current word without breaking the condition loses. Also if by the end of a turn a certain string s is written on paper, then the player, whose turn it just has been, gets a number of points according to the formula: where Your task is to learn who will win the game and what the final score will be. Every player plays optimally and most of all tries to win, then -- to maximize the number of his points, then -- to minimize the number of the points of the opponent. The first input line contains an integer n which is the number of words in the located dictionary (1 ≤ n ≤ 30). The n lines contain the words from the dictionary -- one word is written on one line. Those lines are nonempty, consisting of Latin lower-case characters no longer than 30 characters. Equal words can be in the list of words. On the first output line print a line "First" or "Second" which means who will win the game. On the second line output the number of points of the first player and the number of points of the second player after the game ends. Separate the numbers by a single space.