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

 class Solution {
    
         static int gcd(int a, int b)
    {
        if (a == 0)
            return b;
        return gcd(b%a, a);
    }
    

    static long maximumValue(int[] a) {
        int answer=0,maxi=0;
        
        int n=a.length;
        int i,j;
        
        int x[][]=new int[a.length][a.length];
        for(i=0;i<n;i++)
        {
        for(j=i;j<n;j++)
        {
            int z1;
            int sum=0,max=0,w=0;
                for(z1=i;z1<j;z1++)
                {

                     int result = a[z1];
                     int o=a[z1+1];
            if(result<0)
            {
                result=-result;
            }
            if(o<0)
            {
                o=-o;
            }
            result = gcd(o, result);

             w=result;
            
         
        }

for(z1=i;z1<=j;z1++)
                {

                    if(a[z1]>max)
                    {
                    max=a[z1];
                    }
                    sum=sum+a[z1];
                }
               

                answer=(w)*(sum-max);
                if(answer>maxi)
                {
                    maxi=answer;
                }

                
                if(sum>maxi)
                {
                    maxi=answer;
                }

               
                if(max>maxi)
                {
                    maxi=answer;
                }


        }
        }
    return maxi;
       
    }

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