#include <stack>
#include <cstdio>
#include <list>
#include <cassert>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <functional>
#include <cstring>
#include <algorithm>
#include <cctype>
#include <string>
#include <map>
#include <cmath>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define SZ(x) (int)x.size()
#define Lowbit(x) ((x) & (-x))
#define MP(a, b) make_pair(a, b)
#define MS(arr, num) memset(arr, num, sizeof(arr))
#define PB push_back
#define X first
#define Y second
#define ROP freopen("input.txt", "r", stdin);
#define MID(a, b) (a + ((b - a) >> 1))
#define LC rt << 1, l, mid
#define RC rt << 1|1, mid + 1, r
#define LRT rt << 1
#define RRT rt << 1|1
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
const double eps = 1e-8;
const int MAXN = 2e4 + 10;
const int MOD = 1e9 + 7;
const int dir[][2] = { {-1, 0}, {0, -1}, { 1, 0 }, { 0, 1 } };
const int hash_size = 4e5 + 10;
int cases = 0;
typedef pair<int, int> pii;
 
set<int> prime;
int vis[MAXN];
void get_prime_table()
{
    int m = (int)sqrt(MAXN + 0.5);
    for (int i = 2; i <= m; i++) if (!vis[i])
        for (int j = i*i; j < MAXN; j += i) vis[j] = 1;
    for (int i = 2; i < MAXN; i++) if (!vis[i])
        prime.insert(i);
}
 
int main()
{
   // ROP;
    get_prime_table();
    int n;
    while (~scanf("%d", &n))
    {
        pii ans;
        ans.X = 1;
        for (int i = 0; i < n; i++)
        {
            int tmp;
            scanf("%d", &tmp);
            set<int>::iterator it = prime.begin();
            for (; it != prime.end(); it++)
            {
                if ((*it) > tmp) break;
                if (tmp % (*it) == 0)
                {
                    if (*it > ans.Y)
                    {
                        ans.Y = *it;
                        ans.X = tmp;
                    }
                }
            }
        }
        printf("%d\n", ans.X);
    }
    return 0;
}