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 sys import stdin, stdout
input, print = stdin.readline, stdout.write


def str_input():
    s = input()
    return s[:len(s)-1]


def main():
    s = str_input()
    cnt = [0 for _ in range(26)]
    for ch in s:
        cnt[ord(ch)-ord('a')] += 1
    odd = 0
    for i in range(26):
        odd += cnt[i] & 1
    if odd == 0:
        print("First\n")
    elif len(s) & 1:
        print("First\n")
    else:
        print("Second\n")


if __name__ == "__main__":
    main()
