#!/bin/python3

import sys

def maximumValue(a):
    mx=0
    s=0
    gcd=1
    ff=0
    for x in range(1,len(a)+1):
        for y in range(x,len(a)+1):
            mx=max(a[x-1:y])
            s=sum(a[x-1:y])
            for k in a[x-1:y]:
                if(abs(k)%gcd):
                    gcd=abs(k)
            if(ff<gcd*(s-mx)):
                ff=gcd*(s-mx)  
    
                    
    return(ff)
            
    # 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(' ')))
    result = maximumValue(a)
    print(result)