program decrementing
  implicit none
  integer :: n, a(100000) = 0, i, m, g, c = 0
  character(6) :: s(0:1) = (/"First ","Second"/)
  read(*,*) n
  read(*,*) a(1:n)
  do
    m = sum(mod(a,2))
    if (mod(n-m,2) == 1) exit
    c = c+1
    if (m /= 1) exit
    do i = 1, n
      if (mod(a(i),2) == 1) then
        if (a(i) == 1) goto 100
        a(i) = a(i)-1
        exit
      end if
    end do
    g = arr_gcd(a(1:n))
    a(1:n) = a(1:n)/g
  end do
100 write(*,'(a)') trim(s(mod(c,2)))
contains
  integer function arr_gcd(a)
    integer, intent(in) :: a(:)
    integer :: i
    arr_gcd = a(1)
    do i = 2, n
      arr_gcd = gcd(arr_gcd,a(i))
    end do
  end
  integer function gcd(a,b)
    integer, intent(in) :: a, b
    integer :: x, y
    x = max(abs(a),abs(b))
    y = min(abs(a),abs(b))
    do while (y > 0)
      gcd = y
      y = mod(x,y)
      x = gcd
    end do
  end
end program decrementing