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 sum=0,max=0;
        long dmax = Long.MIN_VALUE;
        for( int i =0 ; i < a.length ; i++ )
        {
            sum=0;
            for(int j = 0 ; j < a.length ; j++ )
            {
                sum = sum + a[j];
                int gd = gcd( Math.abs(a[i]), Math.abs(a[j]) );
                max = (a[i]>a[j])?a[i]:a[j];
                long dum= gd*(sum - max);
                dmax = dmax >dum ?dmax :dum;
            }
        }
        return dmax ;
    }
    
    static int gcd(int a, int b)
    {
 
    if (a == 0 || b == 0)
       return 0;
 
 
    if (a == b)
        return a;
 
 
    if (a > b)
        return gcd(a-b, b);
    return gcd(a, b-a);
    }
    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();
    }
}