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()
map=[0]*27
for i in s:
    map[ord(i)-ord('a')]+=1
win=0
while(1):
    odd=0
    even=0
    for i in range(27):
        if map[i]&1:
            odd+=1
        elif map[i]!=0 and map[i]%2==0:
            even+=1
    if odd==0 or odd-1==0:
        winner=win
        break
    else:
        win^=1
        flag=False
        if odd>2:
            for i in range(27):
                if map[i]&1:
                    map[i]-=1
                    break
        else:
            for i in range(27):
                if map[i]!=0 and map[i]%2==0:
                    map[i]-=1
                    flag=True
                    break
            if not flag:
                for i in range(27):
                    if map[i]&1:
                        map[i]-=1
                        flag=True
                        break

h={0:'First',1:'Second'}
print(h[winner])
