#include<bits/stdc++.h>
#define R register
using namespace std;
inline int read(){
	int x=0,d=1; char y=getchar();
	while(y<'0'||y>'9'){if(y=='-')d=-1;y=getchar();}
	while(y>='0'&&y<='9'){x=(x<<3)+(x<<1)+(y^'0');y=getchar();}
	return x*d;
}
int n,k,p,l,a[10010];
int main(){
	n=read();
	while(n--){
		k=l=read();
		p=sqrt(k)+1;
		for(R int i=2;i<=l;i++)
			if(k%i==0)++a[i];
	}
	int maxn=0,id=0;
	for(R int i=2;i<=1000;i++)
		if(a[i]>maxn){
			maxn=a[i];
			id=i;
		}
	printf("%d\n",id);
	return 0;
}
#include<iostream>
#include<string>
#include<algorithm>    
#include<cmath>
#include<ctime>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<stack>
#include<queue>
#include<tuple>
#include<cassert>
#include<set>
#include<bitset>
#include<functional>
#include <fstream>
//#include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, x) for(ll i = 0; i < x; i++)
#define rep2(i, x) for(ll i = 1; i <= x; i++)
#define rep3(i, x, y) for(ll i = x; i < y; i++)
#define rep4(i, x) for(ll i = x; i >= 0; i--)
#define all(a) (a).begin(),(a).end()
#define puts(x) cout << (x) << "\n"
using ll = long long;
using ld = long double;
using namespace std;
const ll INF = 1000000000000000000;
const int intINF = 1000000000;
const ll mod = 1000000007;
const ll MOD = 998244353;
const ld pi = 3.141592653589793238;
//const ld EPS = 1e-9;

bool isprime(int p) {
	if (p == 1) return false;
	for (int i = 2; i < p; i++) {
		if (p % i == 0) return false;
	}
	return true;
}
ll gcd(ll a, ll b) {
	if (a < b)swap(a, b);
	if (a % b == 0)return b;
	return gcd(b, a % b);
}
// 返り値: a と b の最大公約数
// ax + by = gcd(a, b) を満たす (x, y) が格納される
//main関数内に extGCD(a, b, x, y); でx, yに解が格納
ll extGCD(ll a, ll b, ll& x, ll& y) {
	if (b == 0) {
		x = 1;
		y = 0;
		return a;
	}
	ll d = extGCD(b, a % b, y, x);
	y -= a / b * x;
	return d;
}
ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}
ll keta(ll n) {
	ll res = 0;
	while (n >= 1) {
		res += n % 10; n /= 10;
	}
	return res;
}
ll modpow(ll x, ll y, ll m) {
	ll res = 1;
	while (y) {
		if (y % 2) { res *= x; res %= m; }
		x = x * x % m; y /= 2;
	}
	return res;
}
ll kaijyo[600005];
void nCkinit(ll n, ll m) {
	ll cnt = 1; kaijyo[0] = 1;
	for (int h = 1; h <= n; h++) { cnt *= h; cnt %= m; kaijyo[h] = cnt; }
}
ll nCk(ll n, ll k, ll m) {
	/*ll a = 1, b = 1;
	for (int h = 1; h <= n; h++) { a *= h; a %= m; }
	for (int h = 1; h <= k; h++) { b *= h; b %= m; }
	for (int h = 1; h <= n - k; h++) { b *= h; b %= m; }*/
	ll a = kaijyo[n], b = kaijyo[k] * kaijyo[n - k] % m;
	return a * modpow(b, m - 2, m) % m;
}
//printf("%.10f\n", n);
typedef pair <ll, ll> P;
typedef pair <char, ll> pp;
ll dx[4] = { 1, 0, -1, 0 }, dy[4] = { 0, 1, 0, -1 };
struct edge { ll to, cost; };
struct status {
	ll v;    //今の頂点
	ll cost; //今までのコスト
	ll ondo; //今の温度(0,1,2)
	ll time; //今の温度になってから何分経ったか

	bool operator<(const status& rhs) const { return cost < rhs.cost; };
	bool operator>(const status& rhs) const { return cost > rhs.cost; };
};



int main() {
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	//cout << fixed << setprecision(15);

	//input
	ll n; cin >> n;
	vector<vector<ll>>a(6, vector<ll>(n));
	rep(i, n) {
		cin >> a[0][i] >> a[1][i] >> a[2][i] >> a[3][i] >> a[4][i];
	}
	vector<ll> stand(40);
	rep(k, n) {
		for (int i = 0; i < (1 << 5); i++) {
			ll cnt = INF;
			for (int j = 0; j <= 5 - 1; j++) {
				if ((i & (1 << j)) > 0) {
					cnt = min(cnt, a[j][k]);
				}
			}
			stand[i] = max(cnt, stand[i]);//cout<<i<<' '<<stand[i]<<endl;
		}
	}
	ll ok = 0, ng = mod, mid = (ok + ng) / 2;
	while (ng - ok > 1) {
		bool flag = false;
		rep(i, n) {
			for (int j = i + 1; j < n; j++) {
				ll cnt = 0;
				rep(k, 5) {
					if (max(a[k][i], a[k][j]) < mid) {
						cnt += pow(2, k);
					}
				}
				if (stand[cnt] >= mid) { flag = true; }
			}
		}
		if (flag) { ok = mid; }
		else { ng = mid; }
		mid = (ok + ng) / 2;
	}
	cout << ok << endl;
	return 0;
}