# URL: https://yukicoder.me/problems/no/761

N = gets.to_i
A = gets.split.map(&:to_i)
S = Array.new(N+1,0)
A.each_with_index do |v,i|
  S[i+1] = S[i] + v
end

def dfs(lower, upper, first_or_not)
  return first_or_not if lower + 1 == upper
  
  sum = S[upper] - S[lower]
  n = upper - lower
  mid = (lower ... upper).bsearch{|i| A[i] * n >= sum }
  
  return first_or_not if mid == lower
  
  right = dfs(mid, upper, !first_or_not)
  left = dfs(lower, mid, !first_or_not)
  
  left == right ? left : first_or_not
end

puts dfs(0, N, true) ? 'First' : 'Second'