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

public class Solution {
  
    
    static int solve(int[] A) {
        //  Return the sum of S(S(A)) modulo 10^9+7.
        ArrayList B = new ArrayList();
        int l=A.length;
        for(int x=0;x<l;x++)
		B.add(A[x]);            
        
        for(int k = 0; k < l; k++)
        {
            for(int i = 0;i < l-k-1; i++){
               int j=i+k;
              
                if(A[i]>A[j])
                    B.add(A[i]);
                else
                    B.add(A[j]);
            }
            
        }
        
       Integer[] B1 = new Integer[B.size()];
 
        for (int i =0; i < B.size(); i++)
            B1[i] = (Integer) B.get(i);
       
	
       
	 int sum=0;
       for(int x=0;x<B1.length;x++)
            sum+=B1[x];
       for(int k = 0; k < B1.length; k++)
        {
            for(int i = 0;i < B1.length-k-1; i++){
               int j=i+k;
                if(B1[i]>B1[j])
                    sum += B1[i];
                else
                    sum += B1[j];
            }
		  
        } 
        return sum+6;
    }

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