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.
from collections import deque
from sys import stdin, stdout
rd = lambda: list(map(int, stdin.readline().split()))
rds = lambda: stdin.readline().rstrip()
ii = lambda: int(stdin.readline())
INF = 1 << 62
mod = 10**9 + 7

s = rds()

l = []
r = deque()

i, j = 0, len(s) - 1
c = 0
while i <= j:
    if s[i] == s[j]:
        if i != j:
            r.appendleft(s[j])
            l.append(s[i])
        else:
            l.append(s[i])
        i += 1
        j -= 1
    else:
        # try remove chars to the right from s[i]
        # and to the left from s[j]
        k = 1
        while i+k <= j and s[i+k] != s[j]:
            k += 1
        
        m = 1
        while j-m >= i and s[j-m] != s[i]:
            m += 1

        if k < m:
            i += k
            c += k
        else:
            j -= m
            c += m


#print('c', c, 's', s, 'p', ''.join(l + list(r)))

if c % 2 == 0:
    print('First')
else:
    print('Second')


#stdout.write(' '.join(map(str, ar)))
#stdout.write(f'{res}')

