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
input = sys.stdin.readline

cc = [0]*(25+1)
for c in input().rstrip() :
	cc[ord(c)-97] += 1

def fCEO() :
	ec, oc = 0, 0
	for e in cc :
		if e&1 : oc += 1
		elif e != 0 : ec += 1
	return ec, oc
		
iF = True
while True :
	ec, oc = fCEO()
	if oc <= 1 :
		print(["Second", "First"][iF])
		exit(0)
	
	if oc&1 :
		for i in range(26) :
			if cc[i]&1 : 
			    cc[i]-=1
			    break
	
	else :
		if ec > 0 :
			for i in range(26) :
			    if cc[i]%2==0 and cc[i]>0 :
			    	cc[i]-=1
			    	break
			    
		else :
		    for i in range(26) :
			    if cc[i]&1 :
			    	cc[i]-=1
			    	break
	iF = not iF