#include <iostream>
#include <cmath>
#include <numeric>
#include <algorithm>
#include <deque>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <map>
#include <stack>
#include <queue>
#include <functional>
#include <climits>
#include <bitset>
#include <random>
#include <tuple>
#include <initializer_list>
#include <fstream>
int main() {
	int n; std::cin >> n;
	std::vector<int> terms(n); for (auto& t : terms) std::cin >> t;
	const auto min = *std::min_element(terms.begin(), terms.end());
	const auto sum = std::accumulate(terms.begin(), terms.end(), 0LL);
	if (n % 2 == 0) {
		if (min % 2 == 0 && sum % 2 == 0) {
			std::cout << "Second\n";
		}
		else {
			std::cout << "First\n";
		}
	}
	else {
		std::cout << ((sum % 2 == 0) ? "Second\n" : "First\n");
	}
}
