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 sol(s):
    a = [0]*26 
    for i in range(len(s)):
        if a[ord(s[i])-97] == 0:
            a[ord(s[i])-97] = 1 
        else:
            a[ord(s[i])-97]+=1 
            
            
    oa = []
    ea = []
    
    for i in range(26):
        if a[i]%2 == 0 and a[i]!=0:
            ea.append(a[i])
        elif a[i]%2 !=0:
            oa.append(a[i]) 
            
    res = sum(oa) - max(oa)
    if res%2 == 0:
        return "First"
    else:
        return "Second"
s = input()
ans = sol(s)
print(ans)