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

public class Solution
{

    static int[] transform(int[] A) 
    {
        int j=0;
        List<Integer> B=new ArrayList<Integer>();
        
        for(int k=0;k<=A.length-1;k++)
        {
            for(int i=0;i<=A.length-k-1;i++)
            {
                j=i+k;
                
                int c=i;
                int d=0;
                int[] num=new int[j-i+1];
                while(c<=j)
                {
                    num[d]=A[c];
                    c++;
                    d++;
                }
                
               int max=max(num);
               B.add(max);
            }
        }
        // int[] newA = B.stream().mapToInt(i->i).toArray();
        int[] newA=B.stream().mapToInt(Integer::intValue).toArray();
        return newA;
    }
    
    static int max(int[] num)
    {
        int maxEle=num[0];
        for(int i=0;i<num.length;i++)
        {
            if(num[i]>maxEle)
                maxEle=num[i];
        }
        return maxEle;
    }
    
    static int sum(int[] arr)
    {
        int sum=0;
        for(int i=0;i<arr.length;i++)
        {
            sum+=arr[i];
        }
        return sum;
    }
    
    static int solve(int[] A) 
    {
        //  Return the length of the longest possible sequence of moves modulo      10^9+7.
        int[] arr=transform(A);
        int[] arr2=transform(arr);
        int result=sum(arr2);
        return result;
    }

    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 result = solve(a);
        System.out.println(result);
        in.close();
    }
}