//Dec 16, 2017 9:51:07 AM
//Loki
//package wc12;
import java.util.*;
public class MaxTransform {

	//static int a
	static ArrayList<Integer> b;//=new ArrayList<>();
	static int solve() {
        //  Return the sum of S(S(A)) modulo 10^9+7.
		long sum=0;
		size=getSize();
//		System.out.println(size);
		tree=new int[size];
		fillTree(0,a.length-1,0);
		
		b=new ArrayList<>();
		//for(int i=0;i<a.length;i++)b.add(a[i]);//=b.get(i);
		for(int k=0;k<a.length;k++) {
			for(int i=0;i<a.length-k;i++) {
				int tmsss=getSum(i, i+k);
				//sum+=tmsss;
				//System.out.println(tmsss+" ------ ");
				b.add(getSum(i, i+k));
			}
		}
		sum=0;
		//System.out.println(b);
		a=new int[b.size()];
		for(int i=0;i<a.length;i++)a[i]=b.get(i);
		size=getSize();
//		System.out.println(size);
		tree=new int[size];
		fillTree(0,a.length-1,0);
		for(int k=0;k<a.length;k++) {
			for(int i=0;i<a.length-k;i++) {
				int tmsss=getSum(i, i+k);
				sum+=tmsss;
				if(sum>1000000008)
					sum%=100000007;
				b.add(getSum(i, i+k));
				//System.out.println(tmsss+" ------ ");
			}
		}
		//System.out.println(b);
		return (int) (sum%100000007);
    }
	
	public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        a = new int[n];
        for(int a_i = 0; a_i < n; a_i++){
            a[a_i] = in.nextInt();
        }
        int result = solve();
        System.out.println(result);
        in.close();
    }
	
	static int a[];
	static int tree[];
	static int size;
	/*public static void main(String[] args) {
		size=getSize();
		System.out.println(size);
		tree=new int[size];
		fillTree(0,a.length-1,0);
		printTree();
		Scanner s=new Scanner(System.in);
		while(true) {
			
			int sum=getSum(s.nextInt(),s.nextInt());
			System.out.println("sum ==>"+sum);
		}
	}*/
	private static int getSum(int rs, int re) {
		if(rs<0||re>a.length-1||rs>re)
		return -1;
		//System.out.println(rs+"<-Checking for range"+re);
		return getSumTree(rs,re,0,a.length-1,0);
	}
	private static int getSumTree(int rs, int re, int ts, int te,int idx) {
	
		//If tree range completely lies in array range
		if(ts>=rs&&te<=re)
			return tree[idx];
		//If tree range completely lies outside the array range
		if(ts>re||te<rs)
			return Integer.MIN_VALUE;
		int mid=ts+(te-ts)/2;
		return Math.max(getSumTree(rs,re,ts,mid,2*idx+1),getSumTree(rs,re,mid+1,te,2*idx+2));
	}
	
	
	
	private static void printTree() {
		System.out.println("******************");
		for(int i:tree) {
			System.out.print(i+" ");
		}

		System.out.println("\n******************");
	}
	private static int fillTree(int as, int ae, int ti) {
		
		//System.out.println(as+" "+ae+" "+ti);
		if(as==ae) {
			tree[ti]=a[as];
//			printTree();
			return a[as];
		}else {
			int amid=(as+ae)/2;
			tree[ti]=Math.max(fillTree(as, amid, 2*ti+1),fillTree(amid+1,ae,2*ti+2));
//			printTree();
			return tree[ti];
		}
	}
	static int check=0;
	
	private static int getSize() {
		// TODO Auto-generated method stub
		return (int)Math.pow(2, Math.ceil(Math.log(a.length)/Math.log(2))+1)-1;
	}
}