#!/bin/python

import sys
from fractions import gcd

def mygcd(arr):
    g = arr[0]
    for i in range(1,len(arr)):
        g = gcd(g,arr[i])
    return g

def maximumValue(a):
    g = 0
    s = 0
    m = 0
    
    tot = 0
    for i in range(len(a)):
        for j in range(i,len(a)):
            #arr = map(abs,a[i:j+1])
            arr = a[i:j+1]
            g = mygcd(arr)
            s = sum(arr)
            m = max(arr)
            tot = max(tot,g * (s - m))
    return tot
    # 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