#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define REP(A,B) for(int (A)=0;(A)<(B);(A)++)

#define lld long double
int P[2222];
int sg[2222];

int main() {
	int n;
	scanf("%d", &n);
	REP(i, n) {
		scanf("%d", P+i);
	}
	sg[1] = 0;
	for(int i = 2; i <= 2000; i++) {
		set<int> reachable;
		for(int k = 1; k < i; k++) {
			int cnum = 0; 
			int hromadekK = i / k;
			int zbyla = i%k;
			if(zbyla) cnum ^= sg[zbyla];
			if(hromadekK % 2 == 1)
				cnum ^= sg[k];
			reachable.insert(cnum);
		}
		for(int q = 0; q < i+1; q++)
			if(!reachable.count(q))
			{
				sg[i] = q;
				break;
			}// else printf("i=%d [%d]", i, q);
//		printf("i=%d, %d\n", i, sg[i]);
	}
	int ans = 0;
	REP(i, n) ans ^= sg[P[i]];
	if(ans == 0) printf("Second\n");
	else printf("First\n");

	return 0;
}