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
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:
    y.remove(z)
for i in y:
    if y.count(i)%2!=0:
        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


print('First' if j%2==0 else 'Second')