n,*a=`dd`.split.map &:to_i
*s=0
n.times{|i|s<<s[i]+a[i]}
#p s
f=->l,r{
    if a[r-1] == a[l]
        return true
	end
    th = a.bsearch_index{|e|e>=(s[r]-s[l]+r-l-1)/(r-l)}
    l_hand = !f[l, th]
    r_hand = !f[th, r]
    return l_hand || r_hand
}
puts f[0,n]?:First: :Second