#include <bits/stdc++.h>
using namespace std;
void solve();
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << "\n";
  err(++it, args...);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int t;
  t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
long long n;
long long mex(unordered_set<long long> &s) {
  long long mex = 0;
  while (s.find(mex) != s.end()) mex++;
  return mex;
}
long long grundy(long long a[], long long k, vector<long long> &dp) {
  if (dp[k] != -1) return dp[k];
  unordered_set<long long> s;
  for (long long i = 0; i < n; i++) {
    if (k - a[i] >= 0) s.insert(grundy(a, k - a[i], dp));
  }
  if (s.empty()) return dp[k] = 0;
  return dp[k] = mex(s);
}
void solve() {
  long long k, i, ans;
  cin >> n;
  long long a[n];
  for (i = 0; i < n; i++) cin >> a[i];
  vector<long long> dp(k + 1, -1);
  dp[0] = 0;
  ans = grundy(a, k, dp);
  if (ans == 0)
    cout << "Second"
         << "\n";
  else
    cout << "First"
         << "\n";
}
