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
import copy
from collections import deque
from collections import *

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


def ll(): return list(map(int, input().split()))


def lf(): return list(map(float, input().split()))


def ls(): return list(map(str, input().split()))


def mn(): return map(int, input().split())


def nt(): return int(input())


def ns(): return input()
s=ns()
ans="First"
ans1="Second"
l=Counter()
for x in range(len(s)):
    l[s[x]]+=1
nt1=[]
sm=0
for x in l:
    if l[x]%2==1:
        nt1.append(l[x])
    else:
        sm+=l[x]
if len(nt1)==0 or len(nt1)==1:
    print(ans)
else:
    nt1.sort()
    sm+=sum(nt1[2:])
    if sm%2==0:
        print(ans1)
    else:
        print(ans)

