#include #include using namespace std; //#include //using namespace atcoder; using ll = long long; using vll = vector; using vvll = vector; using vvvll = vector; using vvvvll = vector; using vvvvvll = vector; using vvvvvvll = vector; using vb = vector; using vvb = vector; using vvvb = vector; using vvvvb = vector; using vd = vector; using vvd = vector; using vvvd = vector; using vvvvd = vector; using vvvvvd = vector; #define all(A) A.begin(),A.end() #define ALL(A) A.begin(),A.end() #define rep(i, n) for (ll i = 0; i < (ll) (n); i++) using pqr = priority_queue, vector>, greater>>; template bool chmax(T& p, T q, bool C = 1) { if (C == 0 && p == q) { return 1; } if (p < q) { p = q; return 1; } else { return 0; } } template bool chmin(T& p, T q, bool C = 1) { if (C == 0 && p == q) { return 1; } if (p > q) { p = q; return 1; } else { return 0; } } ll gcd(ll(a), ll(b)) { if (b == 0)return a; ll c = a; while (a % b != 0) { c = a % b; a = b; b = c; } return b; } ll mod=1e9+7; ll modPow(long long a, long long n, long long p=mod) { if (n == 0) return 1; // 0乗にも対応する場合 if (n == 1) return a % p; if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p; long long t = modPow(a, n / 2, p); return (t * t) % p; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); ll N; cin>>N; ll X=0,A=0; rep(i,N){ ll a; cin>>a; if(a<0)X^=ll(1e18); else X^=a; } if((X==0))cout<<"Second"<