#!/bin/python

import sys
from fractions import gcd

def maximumValue(a):
    ma = 0
    for i in xrange(len(a)):
        for j in xrange(i,len(a)):
            g = reduce(gcd, a[i:j+1])
            s = sum(a[i:j+1])
            m = max(a[i:j+1])
            ans = g*(s-m)
            if(ans>ma):
                ma = ans
    return ma
            


    # Return the maximum value of f among all subsegments [l..r].

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