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.
s=input()
length=len(s)
m=dict()
for i in range(length):
    if s[i] in m:
        m[s[i]]+=1
    else:
        m[s[i]]=1
for i in range(length):
    even=0
    odd=0
    l=list(m.values())
    odd= len(list(filter(lambda x: (x%2) , l)))
    even=len(list(filter(lambda x: (x%2==0) , l)))
    if odd==1 or odd==0:
        if i%2==0:
            print('First')
            break
        else:
            print('Second')
            break
    else:
        deleted=0
        for item in m.keys():
            if m[item]%2==0 and m[item]!=0:
                m[item]-=1
                deleted=1
                break
        if deleted==0:
            for item in m.keys():
                if m[item]!=0:
                    m[item]-=1
                    deleted=1
                    break