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].
       
        int gcd=1;
        int index=2;
                int sum=0;
                
        int fun=0;
                int result1=0,result2=0,result3=0;int max=1;
        for(int i=0;i<a.length;i++)
        {
            for(int j=0;j<a.length;j++)
            {
        
        if(a.length==1){
            gcd=a[1];
        }
        if(a.length>1){
           gcd=gcdd(a[i],a[j]); 
        }
        while(index<a.length){
            gcd=gcdd(gcd,a[index]);
            index++;
        }
           sum=sum+a[i]+a[j];
                for(int e :a)
                    max=Math.max(max,e);
                fun=gcd*(sum-max);
                result1=Math.max(sum,max);
                result2=Math.max(fun,gcd);
                result3=Math.max(result1,result2);
        }
        }
        return result3;
    }
   
    public static int gcdd(int num1,int num2){
        int temp=0;
        while(num2!=0){
            temp=num2;
            num2=num1%num2;
            num1=temp;
        }
        num1=num1<0 ? num1 * (-1):num1;
        return num1;
       
    }
        
    
    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();
    }
}