#!/bin/python3

import sys
import fractions
import functools

def gcd(L):
    return functools.reduce(fractions.gcd, L)

def maximumValue(a):
    # Return the maximum value of f among all subsegments [l..r].
    list1=[]
    for i in range(len(a)):
        for j in range(i,len(a)):
            s=sum(a[i:j+1])
            g=gcd(a[i:j+1])
            m=max(a[i:j+1])
            list1.append(g*(s-m))
    return max(list1)
            

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