#include<bits/stdc++.h>
using namespace std;

const int maxn = 2e5 + 10;
int a[maxn];
int n;
void solve() {
    cin >> n;
    map<int, int>mp;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    sort(a + 1, a + 1 + n);
    if (count(a + 1, a + 1 + n, a[1]) == n)
    {
        cout << a[1] << '\n';
        return;
    }
    for (int i = 1; i <= n; i++)
    {
        if (a[i] % a[1])
        {
            mp[a[i]]++;
        }
    }
    if (mp.empty())
    {
        cout << a[1] << '\n';
        return;
    }

    auto pp = mp.begin();
    auto val = (*pp).first;
    int res = a[1];
    if (res <= (val + 1) / 2 - 1)
    {
        cout << res << '\n';
        return;
    }
    res = (res + 1) / 2;
    cout << max(res, 1) << '\n';
}
signed main()
{
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    int _ = 1;
    // cin >> _;
    while (_--) {
        solve();
    }
}