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()
#if odd length there can be one odd number
#if even length there can be only even number
seen = {}
tot = 0
for l in s:
    if l not in seen:
        seen[l] = 1
    else:
        seen[l] += 1
    tot += 1

o, e = 0,0
for v in seen.values():
    if v % 2 == 0:
        e += 1
    else:
        o += 1

#can be arranged into palindrom if one or less than one amount of chars with odd occurences
#if there are two characters with odd occurences
#abcc
if o <= 1:
    print("First")
elif o%2 == 0:
    print("Second")
else:
    print("First")
