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 = str(input())
def palin(s):
    if len(s)==1:
        return True
    else:
        i=0
        j=len(s)-1
        while j>=i:
            if s[i]!=s[j]:
                return False
            i+=1
            j-=1
        return True

x=1
ans =0
for i in range(len(s)):
    if palin(s)== True:
        ans =1
        if x==2:
            print("Second")
        else:
            print("First")
        break
    
    else:
        
        if palin(s[:i] + s[i+1:])== False:
            if x==1:
                x=2
                s = s[:i] + s[i+1:]
            else:
                x=1
                s = s[:i] + s[i+1:]

if ans ==0:
    if x==1:
        print("Second")
    else:
        print("First")

    

    


    