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()
letters = {}
for i in s:
    if i in letters:
        letters[i] += 1
    else:
        letters[i] = 1
game = True
length = len(s)
times = 0
while game:
    odds = 0
    for i in letters:
        if letters[i] % 2 == 1:
            odds += 1
    if (length % 2 == 0 and odds == 0) or (length % 2 == 1 and odds <= 1):
        game = False
    else:
        times += 1
        evenTaken = False
        length -= 1
        for i in letters:
            if letters[i] % 2 == 0:
                letters[i] -= 1
                evenTaken = True
                break
        if evenTaken == False:
            for i in letters:
                letters[i] -= 1
                if letters[i] == 0:
                    letters.pop(i)
                break
if times % 2 == 0:
    print("First")
else:
    print("Second")