//teja349
#include <bits/stdc++.h>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <utility>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <iomanip> 
//setbase - cout << setbase (16); cout << 100 << endl; Prints 64
//setfill -   cout << setfill ('x') << setw (5); cout << 77 << endl; prints xxx77
//setprecision - cout << setprecision (14) << f << endl; Prints x.xxxx
//cout.precision(x)  cout<<fixed<<val;  // prints x digits after decimal in val

using namespace std;
#define f(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) f(i,0,n)
#define fd(i,a,b) for(i=a;i>=b;i--)
#define pb push_back
#define mp make_pair
#define vi vector< int >
#define vl vector< ll >
#define ss second
#define ff first
#define ll long long
#define pii pair< int,int >
#define pll pair< ll,ll >
#define sz(a) a.size()
#define inf (1000*1000*1000+5)
#define all(a) a.begin(),a.end()
#define tri pair<int,pii>
#define vii vector<pii>
#define vll vector<pll>
#define viii vector<tri>
#define mod (1000*1000*1000+7)
#define pqueue priority_queue< int >
#define pdqueue priority_queue< int,vi ,greater< int > >

//std::ios::sync_with_stdio(false); 
ll a[123456],dp[51234][18],seg[4*51234][2],lazy[4*51234][2],nextmax[51234];

ll gcd(ll a,ll b){
	while(b!=0){
		
		a=a%b;
		swap(a,b);
	}
	return a;
}


ll lolgcd(ll val1,ll val2){
	val1=abs(val1);
	val2=abs(val2);
	if(val1<val2)
		swap(val1,val2);
	return gcd(val1,val2);
}

ll lazyupdate(ll node,ll s,ll e){
	ll val=lazy[node][0];
	seg[node][0]+=val;
	seg[node][1]+=val;
	if(s!=e){
		lazy[2*node][0]+=val;
		lazy[2*node+1][0]+=val;
	}
	lazy[node][0]=0;
	val=lazy[node][1];
	if(val==-inf)
		return 0;
	seg[node][1]=seg[node][0]-val;
	if(s!=e){
		lazy[2*node][1]=val;
		lazy[2*node+1][1]=val;
	}
	lazy[node][1]=-inf;
	return 0;
}
ll build(ll node,ll s,ll e){
	lazy[node][1]=-inf;
	//seg[node][1]=inf;
	if(s==e){
		return 0;
	}
	ll mid=(s+e)/2;
	build(2*node,s,mid);
	build(2*node+1,mid+1,e);
	return 0;

}
ll updatesum(ll node,ll s,ll e,ll l,ll r,ll val){
	lazyupdate(node,s,e);
	if(l<=s && e<=r){
		seg[node][0]+=val;
		seg[node][1]+=val;
		if(s!=e){
			lazy[2*node][0]+=val;
			lazy[2*node+1][0]+=val;
		}
		return 0;
	}
	ll mid=(s+e)/2;
	updatesum(2*node,s,mid,l,r,val);
	updatesum(2*node+1,mid+1,e,l,r,val);
	ll i;
	rep(i,2){
		seg[node][i]=max(seg[2*node][i],seg[2*node+1][i]);
	}
	return 0;
}
ll updatemaxi(ll node,ll s,ll e,ll l,ll r,ll val){
	lazyupdate(node,s,e);
	if(l<=s && e<=r){
		//seg[node][0]+=val;
		seg[node][1]=seg[node][0]-val;
		if(s!=e){
			lazy[2*node][1]=val;
			lazy[2*node+1][1]=val;
		}
		return 0;
	}
	ll mid=(s+e)/2;
	updatemaxi(2*node,s,mid,l,r,val);
	updatemaxi(2*node+1,mid+1,e,l,r,val);
	ll i;
	rep(i,2){
		seg[node][i]=max(seg[2*node][i],seg[2*node+1][i]);
	}
	return 0;
}
ll query(ll node,ll s,ll e,ll l,ll r){
	lazyupdate(node,s,e);
	if(e<l || r<s)
		return 0;
	if(l<=s && e<=r){
		return seg[node][1];
	}
	ll mid=(s+e)/2;
	ll a=query(2*node,s,mid,l,r);
	ll b=query(2*node+1,mid+1,e,l,r);
	return max(a,b);

}
ll getgcd(ll i,ll j){
	ll val=j-i+1;
	ll haha=log2(val);
	return lolgcd(dp[i][haha],dp[j-(1<<haha)+1][haha]);
}
ll getans(ll ind,ll low,ll high){
	ll mid;
	ll val=getgcd(ind,low);
	ll jj,ans=low;
	while(low<=high){
		mid=(low+high)/2;
		jj=getgcd(ind,mid);
		if(jj!=val){
			//ans=jj;
			high=mid-1;
		}
		else{
			ans=mid;
			low=mid+1;
		}
	}
	return ans;
}
int main(){
    std::ios::sync_with_stdio(false);
    ll n;
    cin>>n;
    ll i;
    rep(i,n){
    	cin>>a[i];
    	dp[i][0]=a[i];
    }
    ll j;
    f(i,1,18){
    	rep(j,n){
    		if(j+(1<<i)>n){
    			continue;
    		}
    		dp[j][i]=lolgcd(dp[j][i-1],dp[j+(1<<(i-1))][i-1]);
    	}
    }
    ll maxi=0;
    build(1,0,n-1);
    i=0;
    stack<ll> st;
    while(i<n){
    	while(!st.empty() && a[st.top()]<=a[i]){
    		nextmax[st.top()]=i;
    		st.pop();
    	}
    	st.push(i);
    }
    while(!st.empty()){
    	nextmax[st.top()]=n;
    	st.pop();
    }
    ll low,high,val;
    fd(i,n-1,0){
    	low=i;
    	high=n-1;
    	updatesum(1,0,n-1,i,n-1,a[i]);
    	updatemaxi(1,0,n-1,i,nextmax[i]-1,a[i]);
    	while(low<=high){
    		val=getans(i,low,high);
    		maxi=max(maxi,val*query(1,0,n-1,i,val));
    		low=val+1;
    	}


    }	
    cout<<maxi<<endl;


    return 0;  
    
}