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 check(d):
    chet, nechet = 0, 0
    for i in list(d.keys()):
        if d[i] % 2:
            nechet += 1
        else:
            chet += 1
    if nechet > 1:
        return 0
    else:
        return 1


def main():
    s = input()
    d = {i:0 for i in s}
    for i in s:
        d[i] += 1
    while 1:
        res = check(d)
        if res == 1:
            print('First')
            break
        else:
            print('Second')
            break




if __name__ == "__main__":
    main()