#!/bin/python3

import sys

def find_gcd(a, b):
    while b:
        a, b = b, a%b
    return a

def maximumValue(a):
    # Return the maximum value of f among all subsegments [l..r].
    gcd = a[0]
    for i in a:
        gcd = find_gcd(gcd, i)
    mx = max(a)
    sm = sum(a)
    f = gcd*(sm-mx)
    return f

if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = 0
    for l in range(n):
        for r in range(l+1,n+1):
            result = max(result, maximumValue(a[l:r]))
    print(result)