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.
### NOT solved yet

# s = input()
# r = s[::-1]
# if s==r or len(s)%2==1:
#     print("First")
# else:
#     print("Second")
s0 = input()
r0 = s0[::-1]
s = list(s0)
r = list(r0)

i=0;j=-1;count=0
while i<len(s) and j>-len(s)-1:
    if s==r:
        if count%2==0:
            print("First")
            break
        else:
            print("Second")
            break



    if s[i]==s[j]:
        i+=1;j-=1
        # print(s, r)
        # continue
    else:
        del s[j]
        del r[i]
        count+=1
        # i+=1;j-=1
        # print(s, r)
				   		 	    	  			   	  	  	