import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static long maximumValue(int[] a) {
        // Return the maximum value of f among all subsegments [l..r].
        int i,j,l=a.length,c=0,k=0,sum=0;
        long m=0;
        int f[]=new int[100];
        for(i=0;i<n-1;i++)
        {
            for(j=i+1;j<n;j++)
            {
                if(a[i]%a[i]==0&&a[j]%a[i]==0)
                    gcd=a[i];
                else
                    gcd=a[j];
                m=a[i];
                for(m=i;m<=j;m++)
                { 
                    sum=a[m]+sum;
                    if(m<a[m])
                        m=a[m];
                }
                f[k]=gcd*(sum-m);
                k++;
            }
        }
        m=f[0];
        for(i=1;i<f.length;i++)
        {
            if(m<f[i])
               m=f[i];
        }
        return m;
        }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] a = new int[n];
        for(int a_i = 0; a_i < n; a_i++){
            a[a_i] = in.nextInt();
        }
        long result = maximumValue(a);
        System.out.println(result);
        in.close();
    }
}