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


def main():
    s = input()
    count = Counter(s)
    odd, even = 0, 0

    for c in count.values():
        if c % 2 == 0:
            even += 1
        else:
            odd += 1

    winner = "Second" if odd % 2 == 0 else "First"

    print(winner)


def get_int() -> int:
    return int(input())


def get_list_int() -> list[int]:
    return [int(x) for x in input().split(" ")]


def get_list_str() -> list[str]:
    return input().split(" ")


if __name__ == "__main__":
    main()
