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.
z1 = input()
 
freq_up = [0] * 26
l=[]
for i in range(len(z1)):
  ch = ord(z1[i])
  
  freq_up[ch - 97] += 1
 
o=0
 
for i in z1:
  ch = ord(i)
  if i in l:
      continue
  l.append(i)
  if freq_up[ch - 97] % 2 !=0 :
    o+=1
 
if o <= 1 or o % 2 != 0:
    print("First")      
else:
    print("Second")