#!/bin/python3

import sys
def gcd1(a,b):
    a=abs(a)
    b=abs(b)
    if a==0 or b==0:
        return (b,a)[b==0]
    return gcd1(min(b,a),b%a)
def gcd(a):
    if len(a)==1:
        return abs(a[0])
    k=a[0]
    for i in range(1,len(a)):
        k=gcd1(k,a[i])
    return k
def maximumValue(a):
    ma=-100
    for i in range(0,len(a)):
        for j in range(i+1,len(a)+1):
            k=gcd(a[i:j])
            s=sum(a[i:j])
            m=max(a[i:j])
            r=k*(s-m)
            if r>ma:
                ma=r
            #print(k,s,m,r)
    return ma
            
    

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