# 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)
  return true if lower + 1 == upper # 1枚で回ってきたときは勝ち
  
  sum = S[upper] - S[lower]
  n = upper - lower
  mid = (lower ... upper).bsearch{|i| A[i] * n >= sum }
  
  return true if mid == lower # 全部とれる場合も勝ち。(区間すべて同じ数)
  
  !(dfs(lower, mid) && dfs(mid, upper)) # 相手の勝手順しかなければ負け
end

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