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

public class Solution {

    static long maximumValue(int[] a,int n) {
        // Return the maximum value of f among all subsegments [l..r].
        int gcd =0;
        int sum =0;
        int max =0;
        long func =0;
        long maxFunc=0;
        for(int i=0;i<n;i++)
        {
            for(int j=i;j<n;j++)
            {
                gcd = findGCD(a,i,j);
                sum = findSum(a,i,j);
                max = findMax(a,i,j);
                
                func = gcd*(sum-max);
                if(func <0 && j==0)
                    maxFunc = func;
                if(maxFunc < func)
                    maxFunc = func;
            }
        }
        return maxFunc;
    }
    
    static int findGCD(int[] a, int x, int y) {
        // Return the maximum value of f among all subsegments [l..r].
        int result = a[x];
        for (int i=x+1; i<=y; i++)
            result = gcd(a[i], result);
         
        return result;
    }
    
    static int gcd(int a, int b)
    {
        if (a == 0)
            return b;
        return gcd(b%a, a);
    }
    
    static int findSum(int[] a, int x, int y) {
        int sum =0;
        for(int i=x;i<=y;i++)
        {
            sum = sum + a[i];
        }
        return sum;
    }
    
    static int findMax(int[] a, int x, int y) {
        int max = a[x];
        for(int i=x+1;i<=y;i++)
        {
            if(max < a[i])
                max = a[i];
        }
        return max;
    }
    
    

    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,n);
        System.out.println(result);
        in.close();
    }
}