#!/bin/python3

import sys
from fractions import gcd
def maximumValue(a):

    for i in range(0,len(a)):
        if (i == 0) :
            gcdd = abs(a[i])
            summ = a[i]
            maxx= a[i]
        else:
            gcdd = gcd(gcdd,a[i]) 
            summ = summ + a[i]
            maxx = max(maxx,a[i])
    result = gcdd * (summ - maxx)
    return(result)
    
    
    
    return(a)
    # Return the maximum value of f among all subsegments [l..r].

if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    check = 0
    for i in range(0,n+1):
      
        for j in range(i,n+1):

            if (i != j):

                if (maximumValue(a[i:j]) > check):
                    check = maximumValue(a[i:j])

    print(check)