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

public class Solution {

    static int gcd(int a, int b)
    {
        if(b>a)
            return gcd(b,a);
        if(a%b==0)
        {
            return b;
        }
        else
        {
            return gcd(b, a%b);
        }
    }
    static long maximumValue(int[] a) {
        int sum=0,gcd,max;
        long ans=0;
        for(int i=0; i<a.length; i++)
        {
            sum=a[i];
            gcd=a[i];
            max=a[i];
            for(int j=i+1; j<a.length; j++)
            {
                gcd=Math.abs(gcd(gcd, a[j]));
                sum+=a[j];
                max=Math.max(max, a[j]);
                ans=Math.max(ans,gcd*(sum-max));
            }
        }
        return ans;
    }

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