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 Little_Girl_and_Game():
    def covert(string):
        list1 = []
        list1[:0] = string
        return list1

    inputList = covert(input())
    uniqueLetters = list(set(inputList))

    index_dict = {}
    for i in uniqueLetters:
        index_dict[i] = []

    for i in range(len(inputList)):
        index_dict[inputList[i]].append(i)

    oddOccurances = 0
    for i in uniqueLetters:
        if len(index_dict[i]) % 2 == 1:
            oddOccurances += 1

    if oddOccurances % 2 == 1:
        print("First")
    else:
        print("Second")


Little_Girl_and_Game()