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

int GCD(int a, int b)
{
    if (a == 0)
        return b;
    return GCD(b%a, a);
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int n,maxflr=-1;
    cin>>n;
    vector<int> v(n);
    for(int i=0;i<n;i++)
        cin>>v[i];
    for(int l=0;l<n;l++)
    {
        for(int r=0;r<n;r++)
        {
            int sum=0;
            for(int k=l;k<=r;k++)
                sum+=v[k];
            int gcd=GCD(v[l],sum-v[l]);
            int maxi=(v[l]>sum-v[l])?v[l]:sum-v[l];
            int flr=gcd*(sum-maxi);
            if(flr>maxflr)
                maxflr=flr;
        }
    }
    cout<<maxflr<<endl;
    return 0;
}