#!/bin/python3

import sys,math
def maximumValue(a,n):
    arr=[0]*n
    for i in range(n):
        for j in range(i,n):
            arr[i]=(math.gcd(i,j)*(sum(a[i:j+1])-max(a[i:j+1])))
    return max(arr)
    # 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,n)
    print(result)