import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class MaxTransfrom {
    
    static int max(int []aa,int k,int j)
    {
        int m=0;
        for(int i=k;i<=j;i++)
        {
            if(aa[i]>m)
            {
                m=aa[i];
            }
        }
        return m;
    }

    static long sum(int[] a)
    {
        long s=0;
        for(int i=0;i<a.length;i++)
        {
            s+=a[i];
        }
        return s;
    }
    
    static int[] solve(int[] A) {
        //  Return the length of the longest possible sequence of moves modulo 10^9+7.
        int l=(A.length*(A.length+1))/2;
        int z=0;
        int[] r=new int[l];
        for(int k=0;k<A.length;k++)
        {
            for(int i=0;i<(A.length-k);i++)
            {
                int j=i+k;
                if(j<A.length)
                {
                    r[z]=max(A,i,j);
                    z++;
                }
            }
        }
        return r;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] a = new int[n];
        for(int a_i = 0; a_i < n; a_i++){
            a[a_i] = in.nextInt();
        }
        int[] result1 = solve(a);
       //System.out.println(result1);
        int[] result=solve(result1);
        //System.out.println(result);
        long out=sum(result);
        System.out.println(out);
        in.close();
    }
}