#include<iostream>
using namespace std;

//KHI XET TOI CAI -1 LA QUYEN NANG DOI THANG THANH THUA (khi chi xet cai cuoi cung
//=> qtam moi thang, thua => no dgian uhon, thang, thua da qd => moi hd hien tai deu de tao ra 
//su thay doi cua btoan con lai => chac chan -1 la doi thua, thang.
const int MAXN = 100'000;
long long n, cnt, ans, a[MAXN + 5];
int main()
{
	ios_base::sync_with_stdio(false); cin.tie(nullptr);
	cin >> n;
	for(int i = 1; i <= n; i ++)
	{
		cin >> a[i];
		if(a[i] == -1)//-1 THI NO LA VO HAN NEN K LQ
		{
			cnt ++;
		}
		else
		{
			ans ^= a[i];
		}
	}
	//CNT CHI LA CAI QD, TA CAN PHAI LM SAO DE CHO TOT NAHT, K LQ ANS
	//CHU KP DAO NGUOC, NO KP MANG Y NGHIA DAO NGUCO MA LA DAU TIEN 2 THG PHAI SD CAI SO DAY DE TRIET
	if(cnt & 1)
	{
		cout << "First\n";
	}
	else cout << (ans ? "First" : "Second") << "\n";//NGOI THANG CHI CAN DAY SECOND VE THE THUA + SL -1 LA CHAN.
}