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.
a=input()
d={}
n=len(a)
for i in a:
    if(i in d):
        d[i]+=1
    else:
        d[i]=1
t=1
while(True):
    o=1
    e=1
    for i in d:
        if(d[i]%2==0):
            e=i
        else:
            o=i
    if(o==1 or n==1):
        if(t==1):
            print('First')
        else:
            print('Second')
        break
    else:
        if(e!=1):
            d[e]-=1
            n-=1
        else:
            d[o]-=1
            n-=1
            if(d[o]==0):
                del d[o]
    t=t^1