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.
import sys

def solve(string):
    n = len(string)
    h = {}
    for i in range(n):
        if string[i] not in h:
            h[string[i]] = 1
        else:
            h[string[i]] += 1
    count = 0
    for v in h.values():
        if v % 2:
            count += 1
    ans = count - 1
    if ans % 2:
        return "Second"
    else:
        return "First"

def main():
    string = sys.stdin.readline().strip("\n")
    print(solve(string))

if __name__ == "__main__":
    main()