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 find(i,s):
    
    for j in range(len(s)):
        if(s[i]==s[len(s)-1-j]):
            return (len(s)-1-j)

def pal(s):
    
    if len(s)==0:
        return -1
    
    if len(s)==1:
        return 1 
    if len(s)==2:
        if s[0]!=s[1]:
            return 1 
        return 2
    
    ans =0
    for i in range(len(s)):
        j = find(i,s)
        ans =max(ans,pal(s[i+1:j])+2)
        
    return ans
    
n = input()
ans = len(n)-pal(n)
if ans%2==0:
    print("First")
else:
    print("Second")