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:
  
      
      
      N
      A_1 A_2 … A_N
attempt: a = int(input())
  x = list(map(int, input().split()))  # x or y
  x.sort()
  c = x[0]
  s = 0
  for i in range(1, a):
      s += x[i] // c
      s += x[i] % c
  if c != 1:
      s += 1
  if s % 2 == 0:
      print("First")
  else:
      print("Second")
  
problem_description: Statement
  
  There are N integers written on a blackboard. The i-th integer is A_i, and the
  greatest common divisor of these integers is 1.
  
  Takahashi and Aoki will play a game using these integers. In this game,
  starting from Takahashi the two player alternately perform the following
  operation:
  
    * Select one integer on the blackboard that is not less than 2, and subtract 1 from the integer.
    * Then, divide all the integers on the black board by g, where g is the greatest common divisor of the integers written on the blackboard.
  
  The player who is left with only 1s on the blackboard and thus cannot perform
  the operation, loses the game. Assuming that both players play optimally,
  determine the winner of the game.
samples: [{"input": "3\n    3 6 7", "output": "First\n    \n\nTakahashi, the first player, can win as follows:\n\n  * Takahashi subtracts 1 from 7. Then, the integers become: (1,2,2).\n  * Aoki subtracts 1 from 2. Then, the integers become: (1,1,2).\n  * Takahashi subtracts 1 from 2. Then, the integers become: (1,1,1).\n\n* * *"}, {"input": "4\n    1 2 4 8", "output": "First\n    \n\n* * *"}, {"input": "5\n    7 8 8 8 8", "output": "Second"}]