#!/bin/python3

import sys

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

def maximumValue(a):
    l=len(a)
    maxx=-9999999999999
    for i in range(l):
        for j in range(i+1,l+1):
            if(j-i==1):
                gcd=a[i]
            elif(j-i==2):
                gcd=find_gcd(a[i],a[i+1])
            else:
                k=i
                num1=a[k]
                num2=a[k+1]
                gcd=find_gcd(num1,num2)
                for q in range(i+2,j):
                    gcd=find_gcd(gcd,a[q])
            tot=sum(a[i:j])
            m=max(a[i:j])
            cal=gcd*(tot-m)
            if(cal>maxx):
                maxx=cal
    return (maxx)
if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = maximumValue(a)
    print(result)