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
# sys.stdout = open('./output.txt', 'w')
# sys.stdin = open('./input.txt', 'r')


s = input()
n = len(s)
l = 0
r = len(s) - 1
c = 0
while l < n and r >= 0 and l != r:
    if s[l] == s[r]:
        l += 1
        r -= 1
    else:
        if s[l] == s[r-1]:
            r -= 1
        elif s[r] == s[l+1]:
            l += 1
        else:
            l += 1
        c += 1
if c % 2 == 0:
    print("First")
else:
    print("Second")
