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.
import sys
from collections import Counter

def main() -> None:
    read = sys.stdin.readline
    values =  read().strip()
    turn = 'First'
    count: dict[str, int] = Counter(values)
    odd_keys = []
    for k, cnt in count.items():
        if cnt % 2 != 0:
            odd_keys.append(k)

    if not odd_keys:
        print(turn)
    else:
        turns_needed = len(odd_keys) - 1
        if turns_needed % 2 == 0:
            print(turn)
        else:
            print('Second')



if __name__ == '__main__':
    main()