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 = list(input())
x = True
# print(len(s)//2)
dt = {}
for i in s:
	if i in dt:
		dt[i] += 1
	else:
		dt[i] = 1

#print(dt)
# for key, val in dt.items():
# 	print(key, val, sep = " ")
cnt = 0
x = True
for key, value in dt.items():
	#print(key, value, sep = " ")
	if value%2 != 0 and cnt < 1:
		cnt += 1
	elif value%2 != 0 and cnt >= 1:
		x = False
		break
	#print(x)
if x:
	print("First")
elif not x and len(s)%2 == 0:
	print("Second")
elif not x and len(s)%2 != 0:
	print("First")

