#!/bin/python3

import sys
from fractions import gcd

def supergcd(b):
    current=0
    for x in b:
        current=gcd(x,current)

    return current

def maximumValue(a):
    # Return the maximum value of f among all subsegments [l..r].
    maxii = 0
    
    for i in range(len(a)):
        for j in range(i,len(a)+1):

            calc = supergcd(a[i:j+1])*(sum(a[i:j+1])-max(a[i:j+1]))

            if calc>maxii:
                maxii=calc
        
    return maxii    
    
if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = maximumValue(a)
    print(result)