#!/bin/python3

import sys

def findgcd(x,y):
    while(y):
        x,y=y,x%y
        
    return x

def maximumValue(a):
    # Return the maximum value of f among all subsegments [l..r].
    count=0
    n= len(a)
    f=[]
    for i in range(0,n):
        for j in range(0,n):
            sum=0
            if i<=j:
                count+=1
                max=a[i]
                gcd = findgcd(a[i],a[j])
                for k in range(i,j+1):
                    gcd=findgcd(gcd,a[k])
                    sum+=a[k]
                    if max<a[k]:
                        max=a[k]
             
                
                f.append(gcd*(sum-max))
                
    f.sort()
    ans = f[-1]
                
    return ans 
             
                        
                       
       
                
                
             
            
            

if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = maximumValue(a)
    print(result)