#!/bin/python3

import sys
import fractions

def gcd(a,b):
    if (a == 0):
        return b
    return gcd(b%a, a)

def gcd_ar(ar):
    if len(ar) == 1:
        return ar[0]
    ans = ar[0]
    for i in ar[1:]:
        ans = gcd(ans,i)
    return ans

def maximumValue(a):
    # Return the maximum value of f among all subsegments [l..r].
    max_val = None
    for l in range(len(a)):
        for r in range(l,len(a)):
            g = gcd_ar(a[l:r+1])
            s = sum(a[l:r+1])
            m = max(a[l:r+1])
            f = g * (s - m)
            if max_val == None:
                max_val = f
            elif max_val < f:
                max_val = f
    return max_val
            

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