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

public class Solution {
    
    static int[] getS(int[] A) {
        int n = A.length;
        int newN = (n * (n + 1)) / 2;
       // System.out.println("newN = " + newN);
        int[] B = new int[newN];
        int m = 0;
        for(int k = 0; k < n; k++) {
            for(int i = 0; i < n - k; i++) {
                int max = Integer.MIN_VALUE;
                for(int l = i; l <= i + k; l++) {
                    max = Math.max(max, A[l]);
                }
                B[m] = max;
               // System.out.println("max = " + max);
                m++;
            }
        }
        
        return B;
    }

    static int solve(int[] A) {
        //  Return the sum of S(S(A)) modulo 10^9+7.
        int n = A.length;
        if(n == 0) return 0;
        int[] B = getS(getS(A));
        int sum = 0;
        for(int i = 0; i < B.length; i++) {
            sum += B[i];
        }
        return sum;
    }

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