#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
typedef unsigned long long ull;
const ull MOD = 1000000007;

ull cal(int n) {
    ull sum=0;
    for(int k=0; k<n; k++) {
        sum+=(ull)pow(n-k, k)%MOD;
        sum%=MOD;
    }
    return sum;
}
ull solve(vector<int> &vi) {
    int t = vi[0];
    ull ans=1;
    int i=0,lastIdx=0;
    for(; i<vi.size()-1; i++) {
        if(vi[i]>vi[i+1]) {
            ans*=cal(i+1-lastIdx);    
            lastIdx = i+1;
            ans%=MOD;
        }
        t=vi[i];
    }
    ans*=cal(vi.size()-1-lastIdx+1);
    ans%=MOD;
    return ans;
}

int main() {
    int n;
    cin>>n;
    vector<int> vi(n,0);
    for(int i=0; i<n;i++) {
        cin>>vi[i];
    }
    cout<<solve(vi)<<endl;
    return 0;
}