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.
s = input()
s=sorted(s)
data = []
j=1
for i in range(1, len(s)):
    if s[i - 1] != s[i]:
        data.append(j)
        j=1
    else:
        j+=1
data.append(j)
player = 1
while True:
    player = (player + 1) % 2
    if sum(x % 2 for x in data) < 2:
        for i in range(len(data)):
            if data[i] % 2 == 0 and data[i] != 0:
                data[i] -= 1
                break
    else:
        print('First' if player == 1 else 'Second')
        break
