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.
'''
*    author:  Adham0      
*    created: 19.08.2023 02:46:25
 
*     █████  ██████  ██   ██  █████  ███    ███ 
*    ██   ██ ██   ██ ██   ██ ██   ██ ████  ████ 
*    ███████ ██   ██ ███████ ███████ ██ ████ ██ 
*    ██   ██ ██   ██ ██   ██ ██   ██ ██  ██  ██ 
*    ██   ██ ██████  ██   ██ ██   ██ ██      ██ 
'''

from collections import Counter

def c(l, o):
    if o > 1:
        return False
    if l % 2 == 0 and o == 0:
        return True
    if l % 2 != 0 and o == 1:
        return True
    
    return False

def ch(j):
    if j == 1:
        return 'First'
    else:
        return 'Second'

s = input()

val = Counter(s)
val = sorted(val.values(), reverse=True)
oo = list(filter(lambda x: x % 2 == 1, val))
o = len(oo)

j = 1
for i in range(len(val)):
    l = sum(val)
    if c(l, o):
        print(ch(j))
        exit()
    if val[-1] % 2 == 1 and o > 0:
        o -= 1
    val = val[:-1]
    j += 1