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.
s = input()

d = {}
for i in s:
    if d.get(i) is None: d[i] = 1
    else: d[i] += 1

p = 1

while True:
    odds = 0
    for i in d.values():
        if i % 2 == 1: odds += 1
    if odds < 2: break

    f = False
    
    for i in d.keys():
        if d[i] % 2 == 0:
            d[i] -= 1
            f = True
            break
    if not(f):      
        for i in d.keys():
            if d[i] % 2 == 1:
                d[i] -= 1
                if d[i] == 0: del d[i]
                break
    
    p = 3 - p

print('First' if p == 1 else 'Second')
