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

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

int main() {
    int n;
    cin >> n;
    vector<int> v;
    vector<int> s;
    s.push_back(0);
    int x;
    for(int i=1; i<=n; ++i){
        cin >> x;
        v.push_back(x);
        s.push_back(s[i-1]+x);
    }
    
    int maxr = -1;
    for(int l=0; l<n; ++l){
        for(int r=l; r<n; ++r){
            int gc=v[l];
            for(int i=l+1; i<=r; ++i){
                gc = gcd(gc, v[i]);
            }
            int su = 0;
            int ma = -1;
            for(int i=l; i<=r; ++i){
                ma = max(ma, v[i]);
                su += v[i];
            }
            maxr = max(maxr, gc*(su-ma));
        }
    }
    cout << maxr;
    return 0;
}