Godsend

Leha somehow found an array consisting of n integers. Looking at it, he came up with a task. Two players play the game on the array. Players move one by one. The first player can choose for his move a subsegment of non-zero length with an odd sum of numbers and remove it from the array, after that the remaining parts are glued together into one array and the game continues. The second player can choose a subsegment of non-zero length with an even sum and remove it. Loses the one who can not make a move. Who will win if both play optimally?

Input

First line of input data contains single integer n (1 ≤ n ≤ 106) — length of the array.

Next line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 109).

Output

Output answer in single line. "First", if first player wins, and "Second" otherwise (without quotes).

Examples

Input

4
1 3 2 3

Output

First

Input

2
2 2

Output

Second

Note

In first sample first player remove whole array in one move and win.

In second sample first player can't make a move and lose.

这个题是个水题，也算是一个思维题，第一个人可以选择和为奇数的一段取走，第二个人选择和为偶数的一段取走，看看谁无法操作，于是你思考一下，偶数加偶数是偶数，但是偶数加奇数是奇数，这个明显显示出奇数的bug存在，只要有1个奇数，那么和他相连的偶数全都被消灭了。而剩下的和也是奇数，不然停不下来。

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<iostream>
#include<algorithm>
using namespace std;
#define inf 0x3f3f3f3f
#define N 1000005
int main()
{
    long long n;
    while(~scanf("%lld",&n))
    {
        long long i,j,num1=0,num2=0,x,sum=0;
        for(i=0; i<n; i++)
        {
            scanf("%lld",&x);
            if(x%2!=0)
                num1++;
        }
        if(num1!=0)
            printf("First\n");
        else
            printf("Second\n");
    }
    return 0;
}