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].
        long result=0,Gcd=-1231241,sum=0,max;
        for(int i=0;i<a.length;i++)
        {
            max=a[i];
            for(int j=i;j<a.length;j++)
            {
                sum+=a[j];
                if(a[j]>max)
                    max=a[j];
            }
            Gcd=findGCD(a,i,j);
            long temp=Gcd*(sum-max);
            if(temp>result)
                result=temp;
         }
        return result;
    }
    static int gcd(int a, int b)
    {
        if (a == 0)
            return b;
        return gcd(b%a, a);
    }
     
    // Function to find gcd of array of
    // numbers
    static int findGCD(int arr[],int i, int j)
    {
        int result = arr[0];
        for (; i<j; i++)
            result = gcd(arr[i], result);
         
        return result;
    }

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