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.
// Problem: B. Little Girl and Game
// Contest: Codeforces - Codeforces Round 169 (Div. 2)
// URL: https://codeforces.com/contest/276/problem/B
// Memory Limit: 256 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

from collections import Counter
def solve()
	s=input()
	dic=Counter(s)
	cnt=0
	
	for k,v in dic.items():
		if v%2==1:
			cnt+=1
	if cnt<=1:
		print("First")
		return


	if cnt%2:
		print("First")
		return
	else:
		print("Second")
		return
solve()