The Little Girl loves problems on games very much. Here's one of them.

Two players have got a string *s*, consisting of lowercase English letters. They play a game that is described by the following rules:
 -  The players move in turns; In one move the player can remove an arbitrary letter from string *s*. -  If the player before his turn can reorder the letters in string *s* so as to get a palindrome, this player wins. A palindrome is a string that reads the same both ways (from left to right, and vice versa). For example, string "abba" is a palindrome and string "abc" isn't. 
Determine which player will win, provided that both sides play optimally well — the one who moves first or the one who moves second.
The input contains a single line, containing string *s* (1 ≤ |*s*|  ≤  10<sup class="upper-index">3</sup>). String *s* consists of lowercase English letters.

def count_impair_occurence(s):
    nb = 0
    ch = s
    i = 0
    while(i < len(ch)):
        c = ch[i]
        while((ch.count(c)) % 2 == 1):
            nb = nb + 1
            ch = ch.replace(c, '', 1)
            if(i < len(ch)):
                c = ch[i]
            else:
                break
        i = i + 1

    return(nb)


s = input()
nb_move = 0
while(count_impair_occurence(s) > 1):
    for i in range(len(s)):
        c = s[i]
        if(s.count(c) % 2 == 1):
            s = s.replace(c, '', 1)
            nb_move = nb_move + 1
            break

if(nb_move % 2 == 0):
    print("First")
else:
    print("Second")