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 math
import bisect
import itertools
import copy
import sys

input = lambda: sys.stdin.readline().rstrip("\r\n")

def intmap():
    return map(int,input().split())
    
def lintmap():
    return list(map(int,input().split()))
    
def lstrmap():
    return list(map(str,input().split()))
    
def freq(l):
    d = {}
    for i in l:
        d[i] = d.get(i,0) + 1
    return d
    
def subseq(b,s):
    c = 0
    n = len(s)
    for i in b:
        if s[c] == i and c != n:
            c += 1
        if c == n:
            return True 
    return False

def factors(n):
    l = []
    for i in range(2,int(n**0.5) + 1):
        if n%i == 0:
            l.append(i)
            l.append(n//i)
    return l

s = input()
d = freq(s)
c = -1
for i in d:
    if d[i]%2:
        c += 1

if c == -1:
    print("First")
elif c%2:
    print("Second")
else:
    print("First")
        
    

        



    
            
        
        
        