#include <bits/stdc++.h>
#define mod 1000000007
using namespace std;

int modulo(int a,int b,int c){
    // res is kept as long long because intermediate results might overflow in "int"
    long long res = 1; 
    for(int i=0;i<b;i++){
        res *= a;
        res %= c; // this step is valid because (a*b)%c = ((a%c)*(b%c))%c
    }
    return res%c;
}

long long int cnt,arr[1500];

int main() {
    int n,a;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>arr[i];
    }
    for(int i=1;i<=n;i++){
        if(arr[i]>=arr[i-1])
            cnt+=(modulo(i,n-i,mod));
    }
    cout<<cnt<<endl;
    return 0;
}