#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i=0; i<(n); ++i)
#define st first
#define nd second
#define pb push_back
#define mp make_pair

typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;

const int N = 2010;
// 0- tylko 0, 1 - tylko 1, 2 - 0 i 2
bool dp[N];

bool oblicz_stan(int x) {
	for (int i = 2; i <= x - 1; i++) {
		int cnt = 0;
		int ile = x / i;
		int reszta = x % i;
		cnt += dp[i] ? ile : 0;
		if (dp[reszta])
			cnt += 1;
		
		if (cnt > 0 && cnt % 2 == 0) return true;
	}
	
	return false;
}

int nums[N];

int main(){
	int n;
	int mx = 0;
	scanf("%d", &n);
	
	int ile1 = 0;
	
	rep(i, n) {
		scanf("%d", &nums[i]);
		if (nums[i] > 1) ile1++;
		mx = max(mx, nums[i]);
	}

	dp[3] = true;
	
	for (int i = 4; i <= mx; i++) {
		dp[i] = oblicz_stan(i);
	}		

	int liczba01 = 0;		
	rep (i, n) {
		if (dp[nums[i]]) liczba01++;	
	}		
	
	if (liczba01 > 0) {
		puts(liczba01 % 2 == 1 ? "First" : "Second");
	} else {
		puts(ile1 % 2 == 1 ? "First" : "Second");
	}
}