#include<bits/stdc++.h>
#define vi vector<int>
#define INF INT_MAX
using namespace std;

int gcd(int a,int b){
	if(!b) return a;
	return gcd(b,a%b);
}

struct sol{int g,s,m,ans;
sol(int a=0,int b=0,int c=0,int d=0):g(a),s(b),m(c),ans(d){
}
};


class SegmentTree{
vector<sol> st;
int n; // No. of elements in the original array

void make_segment_tree(const vector<int>& v,int pos,int low,int high,int& anss)
{
	if(low==high){
		st[pos]=sol(v[low],v[low],v[low],0);
		return;	}
		else{
		int mid=(low+high)/2;
		make_segment_tree(v,2*pos+1,low,mid,anss);
		make_segment_tree(v,2*pos+2,mid+1,high,anss);
		//st[pos]=min(st[2*pos+1],st[2*pos+2]);
		int q=2*pos+1,w=2*pos+2;
		st[pos].g=gcd(st[q].g,st[w].g),st[pos].m=max(st[q].m,st[w].m);
		st[pos].s=st[q].s+st[w].s,st[pos].ans=max(st[q].ans,st[w].ans);
		anss=max(anss,st[pos].g*(st[pos].s-st[pos].m));
	}
}

/*void RMQ(int qlow,int qhigh,int pos,int low,int high,int & anss)
{
	if(qlow<=low&&qhigh>=high){
	    anss=max(anss,st[pos].g*(st[pos].s-st.pos[m]))
		 //Total Overlap
		return st[pos];}
	else if(qlow>high||qhigh<low)  //No Overlap
		return INF;
	else{                          //Partial Overlap
		int mid=(low+high)/2,a,b;
		a=RMQ(qlow,qhigh,2*pos+1,low,mid);
		b=RMQ(qlow,qhigh,2*pos+2,mid+1,high);
		return min(a,b);
	}
}

void update(vi& v,int index,int val,int pos,int low,int high)
{
	if(low==high){// low==high==index
		st[pos]=val;
		return;
	}
	else{
		int mid=(low+high)/2;
		st[pos]=min(st[pos],val);// or do the update afterwards (st[pos]=min(st[2*pos+1],st[2*pos+2]))
		if(index<=mid)
			update(v,index,val,2*pos+1,low,mid);
		else
			update(v,index,val,2*pos+2,mid+1,high);
	}
}*/

public:
	int e=0;
SegmentTree(const vi& v){
	n=v.size();
	
	int pow2=ceil(log(n)/(double)log(2));
	st.resize(2*pow(2,pow2)-1);
	
	make_segment_tree(v,0,0,n-1,e);
}

/*int RMQ(int qlow,int qhigh){
	if(qlow==0&&qhigh==n-1)
		return st[0];
	else
		return RMQ(qlow,qhigh,0,0,n-1);
}

void update(vi& v,int index,int val)
{
	return update(v,index,val,0,0,n-1);
}*/

int answer(){
	return st[0].ans;
}

/*void display()
{
	int pow2=ceil(log(n)/(double)log(2));
	for(int i=0,k=0;i<=pow2;i++){
		for(int j=0;j<pow(2,i);j++,k++)
			cout<<st[k]<<' ';
	cout<<endl;
}}*/
};

main()
{
int n;
cin>>n;
vi v(n);
for(int& i : v)cin>>i;
SegmentTree st(v);
cout<<st.e;	
}