#!/bin/python3

import sys
from fractions import gcd

def GCD(a):
    result = a[0]
    for i in a[1:]:
        result = gcd(result, i)
    return result

def maximumValue(a):
    m = -99999999
    for l in range(len(a)-1):
        for r in range(l+1,len(a)+1):
            subs = a[l:r]
            ans = GCD(subs) * (sum(subs) - max(subs))
            m = max(m, ans)
    return m

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