#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
vector<int> just;

/*int maximum(int x,int y)
{
    if(x>y)
         return x;
    else
         return y;
}*/

int GCD(int A,int B)
{
    if(A==0)
        return B;
    else
        return GCD(B%A,A);
}

int findGCD(vector<int> arr,int n)
{
    int result=arr[0];
    for(int i=1;i<n;i++)
        result=GCD(arr[i],result);
    return result;
}

int summation(vector<int> arr, int n)
{
    int sum=0;
    for(int i=0;i<n;i++)
        sum+=arr[i];
    return sum;
}
int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int n;
    cin>>n;
    int i,a[n],j;
    for(i=0;i<n;i++)
        cin>>a[i];
    
    for(i=0;i<n;i++)
    {
       for(j=i;j<n;j++)
       {
           int gcd,sum=0;
           int l=i,r=j;
           vector<int> another;
           for(l=i;l<=r;l++)
               another.push_back(a[l]);
           gcd=findGCD(another,another.size());
           sum=summation(another,another.size());
           int maxi=*max_element(another.begin(),another.end());
             just.push_back(gcd*(sum-maxi));
       }
    }
    cout<<*max_element(just.begin(),just.end());
    return 0;
}