For this Question: There are some monsters troubling Newton. He wants to get rid of as many monsters as possible.

Coincidentally the monsters also don't like each other. So Newton got an idea and he gathered all the N monsters together in a pit.

Now all the monsters started attacking each other. They all have some health and the health of the i- th monster is H<sub>i</sub>. A monster dies when its health becomes less than 1. When a monster attacks another monster, the health of monster that is attacked is reduced by an amount that is equal to the health of the attacking monster.

Since a single monster will always remain alive in the end, find out the minimum possible health of the last alive monster.The first line of the input contains a single integer N
The second line of the input contains N space separated integers H<sub>1</sub>, H<sub>2</sub>,. ., H<sub>N</sub>Find the minimum possible final health of the last alive monster.<b>Sample Input 1:</b>
4
2 20 10 30

<b>Sample Output 1:</b>
2

<b>Explanation</b>
The first monster will attack and kill all the remaining monsters.


<b>Sample Input 2:</b>
4
5 13 8 20000

<b>Sample Output 2:</b>
1


<b>Sample Input 2:</b>
4
5 5 5 5

<b>Sample Output 2:</b>
5, I have written this Solution Code: #include<bits/stdc++.h>

using namespace std;

int main(){
	int n; cin>>n;
  	int g; cin>>g;;
  	for(int i=1; i<n; i++){
      int t; cin>>t;
      g = __gcd(t, g);
    }
  	cout<<g;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?