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.
w=input()

def alphabet_frequencies(w):
    alphabets={}
    for x in range(len(w)):
        alphabets[w[x]]=0
    for x in range(len(w)):
        alphabets[w[x]]=alphabets[w[x]]+1
    return alphabets

def count_steps(alphabets):
    key_list=list(alphabets.keys())
    steps=-1
    for x in key_list:
        if(alphabets[x]%2==1):
            steps=steps+1
    return steps

def decide_winner(steps):
    if(steps%2==0):
        return ("First")
    if(steps%2==1):
        return ("Second")

alphabets= alphabet_frequencies(w)
steps=count_steps(alphabets)
winner=decide_winner(steps)
print(winner)
    