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
# 1. figure out if current string is a palindrome
# 1.1 palindrome, can have at most 1 odd letter and all other letters must be even
# 2. remove letter in such a way as to not amke a plaindrome
# 2.1 removing any even is the best strategy?
# 3. If it is imporssible to do so, the opposite player wins
s = input()
c = Counter(s)
even = {}
odd = {}
for key, value in c.items():
    if value % 2 == 0:
        even[key] = value
    else:
        odd[key] = value
i = 0
while True:
    if len(odd) <= 1: 
        print('First' if i % 2 == 0 else 'Second')
        break
    if even:
        key, value = even.popitem()
        odd[key] = value - 1
    else:
        key, value = odd.popitem()
        if value > 1:
            even[key] = value - 1
    i += 1

            

