def dincpr(x,w,z):

    if (x == w):
        return prices[x]*z
    else:
        key = str(w)+'_'+str(w)
        try:
            melh = memo[key]
        except KeyError:
            melh = max(prices[x]*z+dincpr(x+1,w,z+1), prices[w]*z+dp(x,w-1,z+1))
            memo[key] = melh
        return best

while (True):
    try:
        ent = input()
        ent = int(ent)
        if (ent > 0):
            prices = []
            memo = {}
            for i in range(ent):
                insertedPrice = input()
                insertedPrice = int(insertedPrice)
                prices.append(int(insertedPrice))
            print(dincpr(0,len(prices)-1,1))
        else:
            print(0)

    except EOFError:
        break