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.
from math import ceil
from sys import exit
# a=[1,2,3,4,5,6,7,3,0]
# y=list(reversed(a))
# #print(a[ceil(len(a)/2):])
# print(len(a))
# print(a.index(7),y.index(7))
def ispolindrome(y):
    
    l=list(reversed(y[ceil(len(y)/2):]))
        #print(z,y[:ceil(len(y)/2)-1])
    #print(l,y[:ceil(len(y)/2)-1])
    if l==list(y[:ceil(len(y)/2)-1]) or l==list(y[:ceil(len(y)/2)]) :
            #print('First')
            return 1
    return 0
#print(ispolindrome(['a','b','a']))
x=input()
y=list(x)
if ispolindrome(x)==1:
    print('First')
    exit()
f=[]
for i in y:
    if y.count(i)%2!=0:
        f.append(i)
        del y[y.index(i)]
#print(' '.join(i for i in f))
if len(f)%2==0:j=len(f)
if len(f)&2!=0:j=len(f)-1 
print('First' if j%2==0 else 'Second')
#while ispolindrome(y)!=1:
#    for i in y:
#        #if len(y)%2==0:x=y[ceil(len(y)/2)]
#        if y.count(i)%2