#include <iostream>
#include <set>
#include <vector>
#include <string>
#include <algorithm>

using namespace std;

int main(int argc, char **argv)
{
int piles;
vector<int> tokens;

cin >> piles;

for (int i = 0; i < piles; ++i) {
 int p;
 cin >> p;
 if (p > 1) {
  tokens.emplace_back(p);
 }

}

piles = 0;
while (tokens.size())
{
  if (tokens.size() == 2 && piles%2 != 0) {
   sort(tokens.begin(), tokens.end(),[](int a, int b) {
        return b < a;
    } );
  }
  --tokens[0];
  ++piles;
  if (tokens[0] == 1) {
   tokens.erase(tokens.begin());
  }
}

std::cout << ((piles%2 != 0) ? "First" : "Second") << endl;
return 0;
}