#include <iostream>
#include <vector>
#include <numeric>
#include <queue>
using namespace std;
using ll = long long;

int main() {
	auto cmp = [&](ll i, ll j) {
		return __builtin_ctz(i) > __builtin_ctz(j);
	};
	priority_queue<ll, vector<ll>, decltype(cmp)> pq(cmp);
	ll n; cin >> n;
	for (ll i = 0; i < n; i++) {
		ll x; cin >> x;
		pq.push(x);
	}
	while (pq.size() >= 2) {
		ll a = pq.top();
		pq.pop();
		ll b = pq.top();
		pq.pop();
		pq.push(2*gcd(a,b));
	}
	cout << pq.top() << endl;
}