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.
def ispalindrome(s):
    freq={}
    for i in s:
        freq[i]=freq.get(i,0)+1
        if freq[i]%2==0:
            freq[i]=0
    count=0
    for val in freq.values():
        if val==1:
            count+=1
    if s==''.join(list(reversed(s))) or count<=1:
        return True
    else:
        return False
s=input()
if ispalindrome(s):
    print('First')
else:
    if len(s)%2==0:
        print('Second')
    else:
        print('first')