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 n) {
        // Return the maximum value of f among all subsegments [l..r].
        int[] gc=new int[100];
        int[] sum=new int[100];
        int[] max=new int[100];
        int[] f=new int[100];
        int[] sp=new int[n];
        
        for(int l=0;l<n;l++)
            sp[0]=sp[0]+a[l];
        
        for(int i=0;i<n;i++)
        {
            
            for(int j=i;j<n;j++)
            {
                gc[i]=gcd(a[i],a[j]);
                
                sum[i]=su(a[i],a[j]);
                max[i]=ma(a[i],a[j]);
                
                f[i]=gc[i]+sum[i]+max[i]-sp[i];
                   sp[i]=sum[i];
            }
        }
        
        int largest = f[0];
    for (int k = 1;f[k]!=0; k++)
    {
        if (largest < f[k])
            largest = f[k];
    }
        return largest;
        
        
    }
    static int gcd(int n1,int n2)
    {
        if (n2 != 0)
       return gcd(n2, n1%n2);
    else 
       return n1;
    }
     static int su(int n1,int n2)
    {
        int sum=0;
        if(n1==n2)
            return n1;
         else{
             sum=n1+n2;
        return sum;}
    }
     static int ma(int n1,int n2)
    {
        if(n1>n2)
            return n1;
        else if(n1<n2)
            return n2;
         else 
             return n1;
    }

    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,n);
        System.out.println(result);
        in.close();
    }
}