N = gets.to_i
A = gets.split.map(&:to_i)
RUI = [0]

A.each do |a|
  RUI << RUI.last + a
end

def dfs(l, r)
  return false if l > r
  return true if A[l] == A[r]

  sum = RUI[r + 1] - RUI[l]
  ave = sum / (r - l + 1.0)
  m = A.bsearch_index { |a| a >= ave }

  !dfs(l, m - 1) || !dfs(m, r)
end

if dfs(0, N - 1)
  puts "First"
else
  puts "Second"
end