#include <bits/stdc++.h>

using namespace std;

long int maximumValue(vector <long int> a,long int n) {
    // Return the maximum value of f among all subsegments [l..r].
    long int great,addi;
    long int addition[1000000]={0};
    long int maximus[1000000]={0};
    long int sum[1000000]={0};
    //great=a[0];
    long int i,j,k=0;
    //for(i=1;i<n;i++)
    //{
    //great=GCD(great,a[i]);
    //}
    
    long int total[1000000]={0};
    
    for(i=0;i<n;i++)
    {
        add=a[i];
        great=a[i]; 
        for(j=i+1;j<n;j++)
        {
           //great=GCD(great,a[j]);
            great=__gcd(a[i],a[j]);
            add=add+a[j];
            addition[k]=add;
            maximus[k]=max(a[i],a[j]);
            sum[k]=great;
            k++;
        }
        
    }
    for(i=0;i<k;i++)
    {
        total[i]=sum[i]*(addition[i]-maximus[i]);
    }
    long int maxxx=total[0];
    for(i=0;i<k;i++)
    {
        if(max<total[i])
        {
            max=total[i];
        }
    }
    return max;
}

int main() {
    long int n;
    cin >> n;
    vector<long int> a(n);
    for(long int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long int result = maximumValue(a,n);
    cout << result << endl;
    return 0;
}