#include<bits/stdc++.h>

#define HAS_TEST_CASE 0

namespace rG{

typedef long long ll;

const int N=5e5;

int n,m,k,a[N+10];
char s[N+10];

inline void main(){
	int a,b;
	scanf("%d%d",&a,&b);
	printf("%d\n",2*a+100-b);
}

} // namespace rG

int main(){
#if defined(LOCAL)&&HAS_TEST_CASE
	freopen("tmp.out","w",stdout);
#endif
#if HAS_TEST_CASE
	int T;scanf("%d",&T);
	while(T--)rG::main();
#else
	rG::main();
#endif
	return 0;
}

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;

//template
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
using ll=long long int;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
//end

void solve(int _rot){
   // printf("Case #%d: ",_rot);
   int n;
   cin>>n;
   vector<int> a(n);
   rep(i,0,n)cin>>a[i];

   if(n&1)puts("Second");
   else{
      map<int,int> cnt;
      rep(i,0,n)cnt[a[i]]++;
      for(auto& [tmp,c]:cnt)if(c&1)goto out;
      puts("Second");
      return;
      out:;
      puts("First");
   }
}

int main(){
   int t; scanf("%d",&t);
   rep(rot,0,t)solve(rot+1);
   return 0;
}