#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

int solve(int A_size, int* A) {
    //  Return the sum of S(S(A)) modulo 10^9+7.
    int size=A_size;
    for(int k=0;k<size;k++){
        for(int i=0;i<size-k;i++){
            int j=i+k;
            int max=-1;
            for(int ll=i;ll<=j;ll++){
                if(A[i]>max){
                    max=A[i];
                }
            }
            A[size]=max;
            size++;
        }
    }
    
    int size1=size;
        for(int k1=0;k1<size1;k1++){
        for(int i1=0;i1<size1-k1;i1++){
            int j1=i1+k1;
            int max1=-1;
            for(int ll1=i1;ll1<=j1;ll1++){
                if(A[i1]>max1){
                    max1=A[i1];
                }
            }
            A[size1]=max1;
            size1++;
        }
    }
    
    int sum=0;
    for(int jjj=0;jjj<size1;jjj++){
        sum=sum+A[jjj];
    }
    
    return sum;
}

int main() {
    int n; 
    scanf("%i", &n);
    int *a = malloc(sizeof(int) * n);
    for (int a_i = 0; a_i < n; a_i++) {
       scanf("%i",&a[a_i]);
    }
    int result = solve(n, a);
    printf("%d\n", result);
    return 0;
}