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.
    }

    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();
    }
}
public class arrayTransform{
    //Variables&Initialized 
    int array A[n];
    list B;
    int S(A);//max Transform of arrray A 
    int S(S(A));//sum of Tansformed A 
    int X;//sum of all elements
    public class sumTransfdSolveTest{
        for(i=0;i>=ki.length A-1;i++){ 
            int arr A(n)*maxTransformTo(list B);
            list B=ki_A-1=int kx; 
    }
    for(i=0;i>=i.Length A-k-1;i++){
        int arr A(n)*maxTransformTo(list B);
        list B=i_A-k-1=int ix;
}
int kx+int ix=int jx;{
int array A(ix,jx)*Transform_End(list B);
int array(Aix,Ajx)*int maxTTansfrom_Complete=list B();
int arr A(Aix,Ajx)=subArray(A);
int arr(Aix,Ajx)*S(S(A)))*int maxTransformed_%30&70*Solve()*MATH;
ret S(S(A))=int arr Aix,jx_%30*int subTask=Aix,Aijx%30;
ret S(S(A))=int arr Aix,jx_%70; 
Sum+=%30+70,Aix,Ajx; 
    int arr A(aix,Ajx:%30+70)*modulo 10^9+7*assssert(X);
}
system.out.prntln(Sum of allElements:    +"%30+70*modulo 10^9+7:X"+);{
}
    }
}