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.

def solve(s):

	d={}
	for i in s:
		d[i]=d.get(i,0)+1
	odd=0
	for i in d :
		if d[i]%2==1 :
			odd+=1

	odd-=1
	return 'First' if odd%2==0 else 'Second'


		
		



 
	
 
	
	
 
 
 
 
from sys import stdin
input = stdin.readline


t=input().strip()


print(solve(t))