using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
class Solution {

    static int solve(int[] A) {
        //  Return the length of the longest possible sequence of moves modulo 10^9+7.
        int[] transformed = MaxTransform(A);
        return MaxTransform(transformed).Sum();
    }
    
    static int[] MaxTransform(int[] arr) {
        var transform = new List<int>();
        for(int k = 0; k < arr.Length; k++) {
            for(int i = 0; i < arr.Length - k; i++) {
                int j = k + i;
                transform.Add(arr.Skip(i).Take(j - i + 1).Max());
            }
        }
        
        return transform.ToArray();
    }

    static void Main(String[] args) {
        int n = Convert.ToInt32(Console.ReadLine());
        string[] a_temp = Console.ReadLine().Split(' ');
        int[] a = Array.ConvertAll(a_temp,Int32.Parse);
        int result = solve(a);
        Console.WriteLine(result);
    }
}