For a long time, rich clientele of Binary Casino has been requesting a new way to gamble their money. To fulfill their wishes, the director of Binary Casino decided to introduce a new game called Split Your Tokens.

This game is played only when a customer is about to exit the casino. Instead of exchanging tokens won during his visit, he may take up casino's challenge and bet all of his earned tokens on winning this game. Should the customer lose, all of his tokens are lost in favor of the casino.

When the game starts, the customer splits his tokens into NN piles with not necessarily same amount of tokens in each pile. The customer and the casino then exchange turns ­ in this game we denote the customer as the first player and the casino as the second player. Each player in his turn decides which pile he wants to split and chooses a positive integer KK which is smaller than the size of the selected pile. Then the player splits the selected pile into as many piles of size KK as possible. If any tokens remain, they form another pile on their own. A player loses the game when he can not do any more splitting. The customer (first player) always plays first.

The director of Binary Casino is however not sure, whether this game will be profitable for the casino in the long term. Your task is thus to determine, for a given configuration of piles, which player wins when both players play optimally.

The first line contains one integer NN (1≤N≤20001≤N≤2000), the number of piles. The second line contains a sequence of NN integers PiPi (1≤Pi≤20001≤Pi≤2000), PiPi represents the number of tokens in the ii-th pile.

Output a single line with either "First" or "Second", depending on which player wins the game if both play optimally.

 #include <bits/stdc++.h>

 #define inc(i, j, k) for(int i = j; i <= k; i++)

 #define rep(i, j, k) for(int i = j; i < k; i++)

 #define F(x) ((x)/3+((x)%3==1?0:tb))

 #define G(x) ((x)<tb?(x)*3+1:((x)-tb)*3+2)

 #define INF 0x3f3f3f3f

 #define LL long long

 #define MEM(i, j) memset(i, j, sizeof(i));

 #define gcd(i, j) __gcd(i, j)

 using namespace std;

 const int MAXN = 2e5+;

 const int MM = 2e3+;

 int sg[MAXN];

 int vis[MAXN];

 void getsg()

 {

     int cnt, res;

     sg[] = ;

     MEM(vis, -);

     inc(i, , MM){

         rep(j, , i){

             cnt = i/j;

             res = i%j;

             if(cnt%) vis[sg[res]^sg[j]] = i;

             else vis[sg[res]] = i;

         }

         int k = ;

         while(vis[k] == i && k < MM) k++;

         sg[i] = k;

     }

 }

 int main()

 {

     getsg();

     int N;

     scanf("%d", &N);

     int ans = , tp;

     while(N--){

         scanf("%d", &tp);

         ans^=sg[tp];

     }

     if(ans) puts("First");

     else puts("Second");

     return ;

 }