#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
/*
int gcd(int a, int b)
{
    if(a<0){
        a=a*(-1);
    }
    if(b<0){
        b=b*(-1);
    }
    // Everything divides 0 
    if ((a == 0 && b != 0))
        return b;
    if (a!=0 && b==0)
       return a;
    while(a !=b)
    {
        if(a > b)
            a -=b;
        else
            a -= b;
    }
    return a;
}*/
int gcd(int a, int b) {
    return b == 0 ? a : gcd(b, a % b);
}
int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int n;
    cin>>n;
    vector<int>v(n);
    int max=0;
    
    for(int i=0;i<n;i++){
        cin>>v[i];
    }
    for(int i=0;i<n;i++){
        for(int j=i;j<n;j++){
            int gc=1;
            int sum=0;
            int id=i;
            while(id<=j){
                sum=sum+v[id];
                gc=gcd(gc,abs(v[id]));
                cout<<"gcd is: "<<gc<<endl;
                id++;
            }
            int flar=gc*(sum-(*max_element(v.begin()+i,v.begin()+j)));
            if(flar>max){
                max=flar;
            }     
        }
    }
    cout<<max;
    return 0;
}