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.
First, Second = 'First', 'Second'

def ispalindrom(S: str) -> bool:
    length = len(S)
    counted = {i:S.count(i) for i in set(S)}
    values = counted.values()
    if not length % 2:
        return all([i % 2 == 0 for i in values])
    else:
        count_odd = 0
        for i in values:
            if count_odd > 1:
                return False
            if i % 2:
                count_odd += 1
        return True
    

def main() -> None:
    S = input()
    return First if ispalindrom(S) else Second


print(main())