#include using namespace std; #define rep(i,n) for (int i=0; i<(int)n; i++) #define int long long signed main(){ int n; cin >> n; vector grundy(n+1); rep(i,n){ if(i>68){ grundy[i+1]=grundy[i+1-34]; continue; } set se; rep(j,i/2+1) se.insert(grundy[max(0LL,j-1)]^grundy[max(0LL,i-j-1)]); int gd=0; while(se.count(gd)) gd++; grundy[i+1]=gd; } vector A(n); rep(i,n) cin >> A[i]; sort(A.begin(),A.end()); int ans=0; int ir=1; rep(i,n-1){ if(A[i+1]==A[i]+1) ir++; else{ ans^=grundy[ir]; ir=1; } } ans^=grundy[ir]; if(ans!=0) cout << "First\n"; else cout << "Second\n"; }