#include <bits/stdc++.h>

using namespace std;

typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ldbl;
typedef pair<int, int> pii;
typedef pair<uint, uint> puu;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<uint> vu;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef vector<pii> vpii;
typedef vector<puu> vpuu;
typedef vector<pll> vpll;
typedef vector<pull> vpull;
typedef vector<string> vstr;
typedef vector<double> vdbl;
typedef vector<ldbl> vldbl;
#define pb push_back
#define ppb pop_back
#define pfr push_front
#define ppfr pop_front
#define emp emplace
#define empb emplace_back
#define be begin
#define rbe rbegin
#define all(x) (x).be(), (x).end()
#define rall(x) (x).rbe(), (x).rend()
#define fir first
#define sec second
#define mkp make_pair
#define brif(cond) if (cond) break
#define ctif(cond) if (cond) continue
#define retif(cond) if (cond) return
void canhazfast() {ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);}
template<typename T> T gcd(T a, T b) {return b ? gcd(b, a%b) : a;}
template<typename T> T extgcd(T a, T b, T &x, T &y)
{
    T x0 = 1, y0 = 0, x1 = 0, y1 = 1;
    while (b) {
        T q = a/b; a %= b; swap(a, b);
        x0 -= q*x1; swap(x0, x1);
        y0 -= q*y1; swap(y0, y1);
    }
    x = x0; y = y0; return a;
}
int ctz(uint x) {return __builtin_ctz(x);}
int ctzll(ull x) {return __builtin_ctzll(x);}
int clz(uint x) {return __builtin_clz(x);}
int clzll(ull x) {return __builtin_clzll(x);}
int popcnt(uint x) {return __builtin_popcount(x);}
int popcntll(ull x) {return __builtin_popcountll(x);}
int bsr(uint x) {return 31^clz(x);}
int bsrll(ull x) {return 63^clzll(x);}

int main()
{
    canhazfast();

    int n, ans = 0;

    cin >> n;
    for (int i = 0; i < n; ++i) {
        int a;
        cin >> a;
        ans = gcd(ans, a);
    }
    cout << ans << '\n';

    return 0;
}

#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
int dp[2][100005],dpp[2][100005],a[100005];
int main(){
	int n;
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	dp[0][n]=dp[1][n]=1;
	dpp[0][n]=a[n];
	dpp[1][n]=(-a[n]+mod)%mod;
	for(int i=n-1;i>=1;i--){
		dp[0][i]=(dp[1][i+1]+dp[0][i+1])%mod;
		dp[1][i]=dp[0][i+1];
		dpp[0][i]=(1LL*dp[0][i]*a[i]%mod+dpp[0][i+1]+dpp[1][i+1])%mod;
		dpp[1][i]=(1LL*dp[1][i]*((-a[i]+mod)%mod)+dpp[0][i+1])%mod;
//		printf("%d %d %d %d %d\n",i,dp[0][i],dp[1][i],dpp[0][i],dpp[1][i]);
	}
	printf("%d",dpp[0][1]);
	return 0;
} 