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.
# Python 3 program to print the winner of the game

# Function that returns the winner of the game
def returnWinner(s, l):
	
	# Initialize the freq array to 0
	freq = [0 for i in range(26)]

	# Iterate and count the frequencies
	# of each character in the string
	for i in range(0, l, 1):
		freq[ord(s[i]) - ord('a')] += 1

	cnt = 0

	# Count the odd occurring character
	for i in range(26):
		
		# If odd occurrence
		if (freq[i] % 2 != 0):
			cnt += 1

	# Check condition for Player-1
	# winning the game
	if (cnt == 0 or cnt & 1 == 1):
		return 1
	else:
		return 2

# Driver code
if __name__ == '__main__':
	s = input()
	l = len(s)

	# Function call that returns the winner
	winner = returnWinner(s, l)

	print("First", winner)
	


	  		 	 	 	 	   	 	  	 		 				