For this Question: There are n piles of stones, where the i- th pile has a<sub>i</sub> stones. Two people play a game, where they take alternating turns removing stones.
In a move, a player may remove a positive number of stones from the first non- empty pile (the pile with the minimal index, that has at least one stone). The first player who cannot make a move (because all piles are empty) loses the game. If both players play optimally, determine the winner of the game.The first line of the input contains a single integer n denoting the number of piles. The second line of each test case contains n integers a<sub>1</sub>, …, a<sub>n</sub> where a<sub>i</sub> is equal to the number of stones in the i- th pile.

<b>Constraints</b>
1 &le; n &le; 10<sup>3</sup>
1 &le; a<sub>i</sub> &le; 10<sup>9</sup>If the player who makes the first move will win, output "First". Otherwise, output "Second".<b>Sample Input 1</b>
3
2 5 4
<b>Sample Output 1</b>
First

<b>Sample Input 1</b>
8
1 1 1 1 1 1 1 1
<b>Sample Output 1</b>
Second, I have written this Solution Code: #include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<cstring>
#include<ctime>
#define db double
#define N 100100
using namespace std;

int T,n,num[N];

int main()
{
	int i,j,t;
//	cin>>T;
T=1;
	while(T--)
	{
		scanf("%d",&n);
		for(i=1;i<=n;i++) scanf("%d",&num[i]);
		for(i=1;i<n&&num[i]==1;i++);
		if(i&1) puts("First");
		else puts("Second");
	}
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?