#!/bin/python3

import sys,fractions,functools

def maximumValue(a):
    # Return the maximum value of f among all subsegments [l..r].
    gcds = []
    sums = []
    maxes = []
    f = []
    for s in range(len(a)):
        for e in range(len(a)):
            if s < e:
                p = functools.reduce(fractions.gcd,a[s:e])
                q = sum(a[s:e])
                r = max(a[s:e])
                gcds.append(abs(p))
                sums.append(q)
                maxes.append(r)
                f.append(p*(q-r))
            elif s == e:
                p = a[e]
                q = a[e]
                r = a[e]
                gcds.append(abs(p))
                sums.append(q)
                maxes.append(r)
                f.append(p*(q-r))
                
                
    return(max(f))
    
if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = maximumValue(a)
    print(result)