#include using namespace std; typedef long long ll; typedef pair p_ll; template void debug(T itr1, T itr2) { auto now = itr1; while(now=0; i--) const ll MOD = pow(10,9)+7; const ll LLINF = pow(2,61)-1; const int INF = pow(2,30)-1; vector fac; void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; } ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; } ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; } ll gcd(ll a, ll b) { if (a> N; ll A[N]; rep(i,N) cin >> A[i]; sort(A,A+N); vector nums; ll now = 1; repr(i,1,N) { if (A[i]-A[i-1]==1) now++; else { nums.push_back(now); now = 1; } } nums.push_back(now); // debug(all(nums)); ll xarr[5] = {0,1,1,2,0}; ll xr = 0; for (auto x: nums) xr ^= xarr[x%5]; string result = xr ? "First" : "Second"; cout << result << endl; return 0; }