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.
str_input = str(input())

def num_occurences(string_to_check):
    occ_temp = 0
    while len(string_to_check) != 0:
        first_str = str(string_to_check[0])
        first_str_occur = string_to_check.count(first_str)

        if first_str_occur%2 == 1:
            occ_temp += 1    
        string_to_check = string_to_check.replace(first_str,"")

        if len(string_to_check) == 0:
            return(occ_temp)

num_steps = num_occurences(str_input)
# print(num_steps)

if len(str_input) % 2 == 0 and num_steps % 2 == 0:
    print("Second")
elif len(str_input) % 2 == 0 and num_steps % 2 == 1:
    print("First")
elif len(str_input) % 2 == 1 and num_steps % 2 == 0:
    print("Second")
else:
    print("First")        
