#include <bits/stdc++.h>
using namespace std;
#define fastio (ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL))
typedef long long ll;
typedef long double lld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const int MAXSIZE = 2000000;
const long long INF = 1e18 + 5;
const double EPSILON = 1e-14;
const ll DIV = 2000003;
const long double pi = 3.14159265358979323846264338327950288419716939937510L;

int n;
ll gcd(ll a, ll b)
{
    if (b == 0)
        return a;
    return gcd(b, a % b);
}
pair<ll, ll> arr[200005];

int get(int a)
{
    int ret = 0;
    while (a % 2 == 0)
        ret++, a /= 2;
    return ret;
}
priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<>> pq;

int main()
{
    fastio;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> arr[i].second;
        arr[i].first = get(arr[i].second);
        pq.push(arr[i]);
    }
    while (pq.size() > 1)
    {
        pair<ll, ll> a = pq.top();
        pq.pop();
        pair<ll, ll> b = pq.top();
        pq.pop();
        ll d = 2 * gcd(a.second, b.second);
        pq.push({get(d), d});
    }
    cout << pq.top().second;

    return 0;
}