#include<bits/stdc++.h>
#include<string>
using namespace std;
typedef long long ll;
ll x=1000000007;
void fs(ll &num)
{
    bool neg=false;
    register ll c;
    num=0;
    c=getchar();
    if (c=='-')
    {
        neg=true;
        c=getchar();
    }
    for (;c>47&&c<58;c=getchar())
        num=num*10+c-48;
    if (neg)
        num*=-1;
}
ll gcd(ll a,ll b)
{
    if (a==0)
        return b;
    return gcd(b%a,a);
}
ll findGCD(ll arr[],ll n)
{
    ll result=arr[0];
    for (ll i=1;i<n;i++)
        result=gcd(arr[i],result);
    return result;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    ll n;
    cin>>n;
    ll arr[n];
    ll cv[n];
    cv[0]=abs(arr[0]);
    for (ll i=1;i<n;i++)
    {
        cin>>arr[i];
        cv[i]=abs(arr[i]);
    }
    ll maxi=-9999999999;
    ll l=-1,r=-1;
    for (ll i=0;i<n;i++)
    {
        ll gcdi=cv[i];
        ll sum=0;
        ll maxi2=-999999999999;
        for (ll j=i;j<n;j++)
        {
            maxi2=max(maxi2,arr[j]);
            gcdi=gcd(gcdi,cv[j]);
            sum+=arr[j];
        }
        ll k=gcdi*(sum-maxi2);
        maxi=max(maxi,k);
    }
    cout<<maxi;
}