import sys
sys.setrecursionlimit(10000)
input()
l=[int(i) for i in input().split()]
d={}
def dp(i,j):
    if j-i==1:
        return l[i]
    if (i,j) in d:
        return d[(i,j)]
    ans=0
    a=dp(i,j-1)
    b=dp(i+1,j)
    if a!=b:
        d[(i,j)]=max(a,b)
        return d[(i,j)]
    lo=i+1
    hi=j-1
    while hi-lo>1:
        m=(hi+lo)//2
        e=dp(i,m)
        f=dp(m,j)
        if e<a and f<a:
            d[(i,j)]=a
            return a
        if e==a and f==a:
            d[(i,j)]=2*a
            return 2*a
        if e<a:
            lo=m
        else:
            hi=m
    for k in range(i+1,j):
        a=dp(i,k)
        b=dp(k,j)
        if a==b:
            ans=max(ans,2*a)
        else:
            ans=max(ans,max(a,b))
    d[(i,j)]=ans
    return d[(i,j)]
print(dp(0,len(l)))