#include<bits/stdc++.h>
using namespace std;
int32_t main(){
	int n;
	cin >> n;
	vector<int> v(n);
	priority_queue<int, vector<int>, greater<int>> q;
	int g = 0;
	for(auto &i : v) {
		  cin >> i;
		  int cnt = 0;
		  while(i%2 == 0) cnt++, i/=2;
		  q.push(cnt);
		//  cout << cnt << endl;
		  g = __gcd(g, i);
	}
	while(q.size() > 1){
		  int f = q.top(); q.pop();
		  int s = q.top(); q.pop();
		//  cout << f << " " << s << endl;
		  q.push(min(f, s) + 1);
		  
	}
	
	cout << pow(2, q.top()) * g;
	
	
	
}