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.
'''
import sys
 
# Fast input
input = sys.stdin.readline
 
# Fast output
def print(*args, **kwargs):
    sep = kwargs.get('sep', ' ')
    end = kwargs.get('end', '')
    file = kwargs.get('file', sys.stdout)
    flush = kwargs.get('flush', False)
    output = sep.join(map(str, args)) + end
    file.write(output)
    if flush:
        file.flush()
'''

for _ in range(1):
    c=[]
    s=input()
    l=list(s)
    x=0
    for i in set(l):
        c.append(l.count(i))
    for i in c:
        if i%2==1:
            x+=1
    if x==0 or x==1:
        print("First")
    elif len(s)%2==0:
        print("Second")
    else:
        print("First")
