#!/bin/python3

import sys

def gcd(a,b):
    if(b==0):
        return a
    if(a==0):
        return b
    if(a>b):
        return gcd(a-b,b)
    else:
        return gcd(b,a)
    
def maximumValue(a):
    # Return the maximum value of f among all subsegments [l..r].
    res = []
    m = -10000
    for i in range(len(a)):
        for j in range(i,len(a)):
                       
            x = gcd(a[i],a[j])*(sum(a[i:j+1]) - max(a[i:j+1]))
            res.append(x)
            
    
    return max(res)

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