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
import math
from sys import stdin, stdout
 
# TAKE INPUT
def get_ints_in_variables():
    return map(int, sys.stdin.readline().strip().split())
def get_int(): return int(input())
def get_ints_in_list(): return list(
    map(int, sys.stdin.readline().strip().split()))
def get_list_of_list(n): return [list(
    map(int, sys.stdin.readline().strip().split())) for _ in range(n)]
def get_string(): return sys.stdin.readline().strip()
 
def main():
    s = input()
    s = ''.join(sorted(s))
    mp = {}
    for i in range(0, len(s)):
        if s[i] not in mp:
            mp[s[i]] = 1
        else:
            mp[s[i]] += 1

    First = False
    i = 0
    while True:
        count = 0
        for key, value in mp.items():
            if value % 2 != 0:
                count += 1
        if i % 2 == 0:
            First = True
        else:
            First = False
        mp[s[i]] -= 1
        i += 1
        if count <= 1:
            break
        
    if First:
        print("First")
    else:
        print("Second")


  
#  calling main Function
if __name__ == "__main__":
    main()