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.
def palidrome(arr,i,j):
    if i>=j:
        return 0
    
    else:
        
        while i<=j:
            if check[i][j] !=-1:
                return check[i][j]
            elif arr[i]==arr[j]:
                check[i][j]= palidrome(arr,i+1,j-1)
                return check[i][j]
            
            else:
                check[i][j]= min(1+palidrome(arr,i+1,j),1+palidrome(arr,i,j-1))
                return check[i][j]
    
arr=input()

check= [[-1]*(len(arr)) for _ in range(len(arr))]

 
x= palidrome(arr,0,len(arr)-1)
if x%2==0:
    print("First")
else:
    print("Second")
        