/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
import java.math.BigInteger;
import java.util.Scanner;
import java.lang.Math;
import static java.lang.Math.pow;

public class Solution {
    static int fac(int n){
        int r=0;
        for(int i=0;i<=n;i++){
            r=r+i;
        }
        return r;
        
    }
    static int max(int[] A,int i , int j) {
        int t=0;
        for(int h=i;h<=j;h++){
            if(A[h]>t){
                t=A[h];
            }
        }
        
        return t;
        //  Return the sum of S(S(A)) modulo 10^9+7.
    }
        static int suma(int[] A) {
        int c=0;
       for(int k=0;k<A.length;k++){
          c=c+A[k];
       }
        
        return c;
        //  Return the sum of S(S(A)) modulo 10^9+7.
    }
    static int[] s(int[] A) {
        int j=0,c=0;
        int size=fac(A.length);
        int[] r=new int[size];
       for(int k=0;k<A.length;k++){
           for(int i=0;i<A.length-k;i++){
               j=i+k;
               
               r[c]=max(A,i,j);
               c++;
           }
       }
        
        return r;
        //  Return the sum of S(S(A)) modulo 10^9+7.
    }

    static int solve(int[] A) {
        int j=0,c=0;
       c=suma(s(s(A)));
        
        return c;
        //  Return the sum of S(S(A)) modulo 10^9+7.
    }

    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();
    }
    
}