output_description: If Takahashi will win, print `First`. If Aoki will win, print `Second`.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      s
attempt: S = input()
  A = len(S) % 2
  B = 0 if S[0] == S[-1] else 1
  print("Second" if A ^ B else "First")
  
problem_description: Statement
  
  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.
samples: [{"input": "aba", "output": "Second\n    \n\nTakahashi, who goes first, cannot perform the operation, since removal of the\n`b`, which is the only character not at either ends of s, would result in s\nbecoming `aa`, with two `a`s neighboring.\n\n* * *"}, {"input": "abc", "output": "First\n    \n\nWhen Takahashi removes `b` from s, it becomes `ac`. Then, Aoki cannot perform\nthe operation, since there is no character in s, excluding both ends.\n\n* * *"}, {"input": "abcab", "output": "First"}]