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 count_odd(cnt: Counter) -> int:
    odd = 0
    for x in cnt:
        odd += cnt[x] & 1
    return odd

cnt = Counter(input())

map = ["First", "Second"]

turn = 0

while cnt:

    odd = count_odd(cnt)

    if odd < 2:
        break
    
    if odd == len(cnt):
        for x in cnt.keys():
            if cnt[x] & 1:
                cnt[x] -= 1
                if cnt[x] == 0:
                    cnt.pop(x)
                break
    else:
        for x in cnt:
            if cnt[x] & 1 == 0:
                cnt[x] -= 1
                break

    turn ^= 1

print(map[turn])