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=list(input())
s1=""
j=0
a=[]
for i in range(len(s)-1,-1,-1) :
    s1+=s[i]
    if s[len(s)-1-i]!=s1[-1] :
        a.append(s[len(s)-1-i])
        j+=1
b=a[0:len(a)//2]
a=a[len(a)//2:]
a.sort()
b.sort()
k=0
j=0
i=0
while i<len(a) :
    j=0
    while j<len(b) :
        if a[i]==b[j] :
            a[i]=4
            b[j]=4
            k+=1
            break
        else :
            k+=2
        j+=1
    i+=1
if len(s)%2==0 :
    k/=2  
if k%2==0 :
    print("First")
else :
    print("Second")