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
s= input();c=0;c1=True
d=Counter(s)

while c1:
    if s== s[::-1]:
        c1=False
    else:
        s=list(s)
        for i in s:
                s.remove(str(d.most_common()[-1][0]))
                s=''.join(s)
                d[str(d.most_common()[-1][0])]-=1
                if d[str(d.most_common()[-1][0])]==0:
                     del d[str(d.most_common()[-1][0])]
                c+=1
                break

print('second' if c%2 else 'First')