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
input = sys.stdin.readline
from collections import Counter

def in_string_to_string():
    s = input()
    return s[:len(s) - 1]

def is_palindrome(counter):
    has_odd = False
    length = 0
    for c in counter:
        length += counter[c]
        if counter[c] & 1 != 0:
            if has_odd == True:
                return False
            has_odd = True
    if has_odd and length & 1 == 0:
        return False
    return True

s = in_string_to_string()
counter = Counter()

for c in s:
    counter[c] += 1
winner_is_first = True
number_of_turns = 1

while is_palindrome(counter) == False:
    number_of_turns += 1
    broken = False
    for c in counter:
        if counter[c] & 1 == 0:
            counter[c] -= 1
            if counter[c] == 0:
                counter.pop(c)
            broken = True
            break
    if broken:
        continue
    for c in counter:
        counter[c] -= 1
        if counter[c] == 0:
            counter.pop(c)
        break
if number_of_turns & 1 == 1:
    print("First")
else:
    print("Second")