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 collections import Counter
def check(a):
    global lenth
    if lenth%2==0:
        x=a[:lenth//2] ; y=a[lenth//2:]
        if x==y[::-1]:
            return True
        else:
            lenth-=1
            a.pop(lenth//2)
    else:
        x=a[:lenth//2] ; y=a[lenth//2+1:]
        if x==y[::-1]:
            return True
        else:
            lenth-=1
            a.pop(lenth//2+1)


string=list(input()) ; lenth=len(string) ; turn=1 ; dic=Counter(string)
while lenth>0:
    if check(string):
        if turn%2==1:   print("First") ; break
        else:   print("Second") ; break
    else:
        turn+=1