#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <stdlib.h>
#include <limits.h>

#define inll(x) scanf("%lld",&x)
#define outll(x) printf("%lld",x)
#define inll2(x,y) scanf("%lld%lld",&x,&y)
#define outll2(x,y) printf("%lld%lld",x,y)
#define inll3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z)
#define outll3(x,y,z) printf("%lld%lld%lld",x,y,z)

#define in(x) scanf("%d",&x)
#define out(x) printf("%d",x)
#define in2(x,y) scanf("%d%d",&x,&y)
#define out2(x,y) printf("%d%d",x,y)
#define in3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define out3(x,y,z) printf("%d%d%d",x,y,z)

#define ll long long
#define div 1000000007

using namespace std;

ll gcd(ll a, ll b)
{
    if (a == 0)
        return b;
    return gcd(b%a, a);
}

int main(){

	ll n;
	cin>>n;
	ll a[n-1],b[n];
	if(n==1)
	{
		ll k;	
		cin>>k;
		cout<<k+1;
	}
	else
	{
		
		ll k;

		for (int i = 0; i < n; ++i)
		{
			cin>>b[i];
			
		}
		k=b[0];
		for (int i = 0; i < n-1; ++i)
		{
			k=gcd(k,b[i+1]);
			ll smaller;
			if(b[i]<b[i+1])
			{
				if(k==b[i])
					k=b[i+1];
			}

			
		}
		cout<<k;
		// ll first,second;
		// first = second = INT_MAX;
		// for (int i = 0; i < n-1; ++i)
		// {
		// 	if (a[i] < first)
	 //        {
	 //            second = first;
	 //            first = a[i];
	 //        }
	 
	 //        else if (a[i] < second && a[i] != first)
	 //            second = a[i];
  //   	}
  //   	cout<<second;

	}
    return 0;
}