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

public class Solution {
    static int gcdcom(int a, int b)
    {
        if (a == 0)
            return b;
        return gcdcom(b%a, a);
    }
    static long maximumValue(int[] a) {
        // Return the maximum value of f among all subsegments [l..r].
        
        long high=-32766;
        for(int i=0;i<a.length;i++)
        {
            for(int j=0;j<a.length;j++)
            {
                long sum=0,f=0,max=0,gcd=0;
                if(i==j)
                {
                    sum=a[i];
                    gcd=a[i];
                    max=a[i];
                }
                else
                {
                    int k=i;
                    while(k<=j)
                    {
                        sum=sum+a[k];
                        k++;
                    }
                    k=i;
                    int temp=a[k];
                    while(k<=j)
                    {
                        if(a[k]>max)
                            max=a[k];
                        k++;
                    }
                    k=i+1;
                    int result=a[i];
                    while(k<j)
                    {
                        result = gcdcom(a[k], result);
                        k++;
                    }
                    gcd=result;
                }
                f=gcd*(sum-max);
                if(f>high)
                    high=f;
            }
        }
        return high;
    }

    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();
    }
}