#include <bits/stdc++.h>

using namespace std;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
#define ten(n) ((int)1e##n)
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;

template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
template<typename ...> static inline void putchar_unlocked(int c) { putchar(c); }
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }
int reader(string& c) { int i; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c.push_back(i); for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c.push_back(i); }; return sz(c); }
template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }
template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }
template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V & w) { reader(x); reader(y); reader(z); reader(w); }
void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }
void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
template<class T> void writerLn(T x) { writer(x, '\n'); }
template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }
template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }
template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }
template<class T> void writerArr(vector<T>& x) { writerArr(x.data(), (int)x.size()); }

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
ll mod_pow(ll a, ll n, ll mod) {
	ll ret = 1;
	ll p = a % mod;
	while (n) {
		if (n & 1) ret = ret * p % mod;
		p = p * p % mod;
		n >>= 1;
	}
	return ret;
}
template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; }
template<class T> T mod_inv(T a, T m) { T x, y; extgcd(a, m, x, y); return (m + x % m) % m; }

int memo[101][101][101];
int dfs(int a, int b, int c) {
	int& ret = memo[a][b][c];
	if (ret != -1) return ret;
	int g = gcd(a, gcd(b, c));
	if (g != 1) {
		return ret = dfs(a / g, b / g, c / g);
	}
	ret = 0;
	if (a > 1 && dfs(a - 1, b, c) == 0) ret = 1;
	if (b > 1 && dfs(a , b - 1, c) == 0) ret = 1;
	if (c > 1 && dfs(a, b, c - 1) == 0) ret = 1;

	return ret;
}

bool dfs(vector<int>& a) {
	ll sm = 0;
	FOR(i, sz(a)) {
		sm += a[i];
	}
	if ((sm - sz(a)) % 2 != 0) return true;

	vector<int> g1(sz(a)), g2(sz(a));
	g1[0] = a[0];
	for (int i = 1; i < sz(a); i++) {
		g1[i] = gcd(g1[i - 1], a[i]);
	}

	g2[sz(a) - 1] = a[sz(a) - 1];
	for (int i = sz(a) - 2; i >= 0; i--) {
		g2[i] = gcd(g2[i + 1], a[i]);
	}
	FOR(i, sz(a)) {
		if (a[i] == 1) continue;
		int gg;
		if (i == 0) gg = g2[1];
		else if (i == sz(a) - 1) gg = g1[sz(a) - 2];
		else {
			gg = gcd(g1[i - 1], g2[i + 1]);
		}
		gg = gcd(gg, a[i] - 1);
		if (gg != 1) {
			vector<int> nw = a;
			FOR(j, sz(a)) {
				if (i != j) nw[j] /= gg;
				else nw[j] = (nw[j] - 1) / gg;
			}
			bool bb = dfs(nw);
			if (!bb) return true;
		}
	}

	return false;
}

int main() {
	//memset(memo, -1, sizeof(memo));
	//memo[1][1][1] = 0;
	//for (int a = 1; a <= 30; a++) {
	//	for (int b = 1; b <= 30; b++) {
	//		for (int c = 1; c <= 30; c++) {
	//			dfs(a, b, c);
	//			int g = gcd(a, gcd(b, c));
	//			if (g != 1) continue;
	//			vector<int> x = { a,b,c };
	//			bool ans = dfs(x);
	//			if (memo[a][b][c] != ans) {
	//				cout << "?";
	//			}

	//			if (memo[a][b][c]) {
	//				printf("%d %d %d\n",a,b,c);
	//			}
	//		}
	//	}
	//}

	int n; reader(n);
	vector<int> a(n);
	FOR(i, n) {
		reader(a[i]);
	}

	bool ans = dfs(a);
	puts(ans ? "First" : "Second");

	return 0;
}

Measured memory_bytes: 27648