\gdef\thisproblemauthor{Ivan Kazmenko}
\gdef\thisproblemdeveloper{Ivan Kazmenko}
\begin{problem}{Forbidden Words}
{forbidden-words.in}{forbidden-words.out}
{2 seconds (\textsl{3 seconds for Java})}{256 mebibytes}{}

In this problem, you have to determine who wins in a game with a dictionary.

You are given a dictionary which is a collection of $n$ different non-empty
words consisting of lowercase English letters.
% The words can contain only the first ten letters of the alphabet. % Div2

Two players take turns.
A turn consists in mentioning a letter. % Div1
% A turn consists in mentioning a letter % Div2
% from the first ten letters of the alphabet. % Div2
One can not mention a letter which was already mentioned
by one of the players.
A player loses the game when, after she mentions a letter,
it is possible to compose a word from the dictionary using
only the mentioned letters.
Each mentioned letter can be used several times if needed.

Which player wins the game if both players play optimally?

\InputFile

The first line of input contains an integer $n$: the number of words.
The next $n$ lines contain the words themselves, one word per line.
Each word is non-empty and consists of lowercase English letters.
It is guaranteed that all the given words are distinct
and their total length does not exceed $3\,000\,000$.
% It is also guaranteed that only the first ten letters of the English % Div2
% alphabet (\texttt{a}--\texttt{j}) are used in the words. % Div2

\OutputFile

If the first player wins, print ``\texttt{First}''.
Otherwise, print ``\texttt{Second}''.

\Examples

\begin{example}
\exmp{
2
a
ab
}{
First
}%
\exmp{
3
da
dee
ea
}{
Second
}%
\end{example}

\Explanations

In the first example, the player who mentions ``\texttt{a}'' loses the game.
If both play optimally, all the other letters will be mentioned before that,
and when there are no more of them, it will be the second player's turn.

In the second example, the player who mentions the second element of the set
$\{\texttt{a}, \texttt{d}, \texttt{e}\}$ loses the game.
Until that moment, $24$ letters will be mentioned % Div1
% Until that moment, eight letters will be mentioned % Div2
if both play optimally, so it will be the first player's turn.

\end{problem}
