There is a string s of length 3 or greater. No two neighboring characters in s are equal.  Takahashi and Aoki will play a game against each other. The two players alternately performs the following operation, Takahashi going first:    * Remove one of the characters in s, excluding both ends. However, a character cannot be removed if removal of the character would result in two neighboring equal characters in s.  The player who becomes unable to perform the operation, loses the game. Determine which player will win when the two play optimally.
s=input()

if len(s)%2==0 and s[0]==s[-1]:
  print('Second')
else: 
  print('First')
s=input()

if (len(s)%2==0 and s[0]!=s[-1]) or (len(s)%2!=0 and s[0]==s[-1]):
  print('Second')
else: 
  print('First')