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.
#文字列入力はするな！！
#carpe diem

'''
         ██╗        ██╗   ███╗   ███╗   ██╗   ████████╗
         ██║        ██║   ████╗ ████║   ██║   ╚══██╔══╝
═════════██╠════════██╠═══██╔████╔██╠═══██╠══════██╠══════════
         ██║        ██║   ██║╚██╔╝██║   ██║      ██║
         ███████╗   ██║   ██║ ╚═╝ ██║   ██║      ██║
         ╚══════╝   ╚═╝   ╚═╝     ╚═╝   ╚═╝      ╚═╝
'''

#文字列入力はするな！！
#carpe diem


s=input()

d={}

for i in s:
    if i not in d:
        d[i]=0
    d[i]+=1

odd=0

for i in d:
    if d[i]%2!=0:
        odd+=1

if odd==0:
    print('First')
elif odd%2==0:
    print('Second')
else:
    print('First')




   
    

#carpe diem 
#carpe diem