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
x=input()
y=list(x)
j=0
if len(y)%2==1:z=y[ceil(len(y)/2)-1]
#print(z)
if len(y)%2==1 :
    l=list(reversed(y[ceil(len(y)/2):]))
    #print(z,y[:ceil(len(y)/2)-1])
    if l==y[:ceil(len(y)/2)-1]:
        print('First')
        exit()

#print(y)
if len(y)%2==1:
    y.remove(z)
    j=j+1
#print(len(y))
for i in y:
    if y.count(i)%2!=0 and y.index(i)!=ceil(len(y)/2)-1:
        del y[y.index(i)]
        j=j+1
        #if len(y)%2==1:
        #    z=y[ceil(len(y)/2)-1]
        #    y.remove(z)
            #j=j+1
    elif y.index(i)!=ceil(len(y)/2)-1 and y.count(i)>1 and y.count(i)%2!=0 :
        a=list(reversed(y))
        del y[len(y)-a.index(i)-1]
        j=j+1



#print(''.join(i for i in y))
print('First' if j%2==0 else 'Second')