#include<iostream>
using namespace std;

int maxm(int a,int b)
{
	return (a>b)?a:b;
}

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

int main()
{
	int i,j,k,n;
	cin>>n;
	int a[n+5];
	long long int ans = 0;
	for(i = 1;i<=n;i++)
	{
		cin>>a[i];
	}
	int g[n+1][n+1],sum[n+1][n+1],m[n+1][n+1];
	for(i = 1;i<=n;i++)
	{
		g[i][i] = abs(a[i]);
		k = abs(a[i]);
		m[i][i] = a[i];
		sum[i][i] = a[i];
		for(j = i+1;j<=n;j++)
		{
			g[i][j] = gcd(k,abs(a[j]));
			sum[i][j] = sum[i][j-1]+a[j];
			m[i][j] = maxm(m[i][j-1],a[j]);
			ans = maxm(ans,g[i][j]*(sum[i][j]-m[i][j]));
		}
		ans = maxm(ans,g[i][i]*(sum[i][i]-m[i][i]));
	}
	cout<<ans;
}