#include <bits/stdc++.h>

using namespace std;
int M = 1000000007 ;
int tab[2003];
int n ;

long long dp[2000][2000];
long long C[2000][2000];
long long fact[2000][2000];
int solve(int p , int nbr){
//    cout << p << ' ' << nbr <<endl;
    if(p==n)return 1;

    long long &r = dp[p][nbr]  ;
    if(r!=-1)return r ;
    r = ((p? nbr : 1ll)*solve(p+1, 1))%M ;
    long long mult = nbr;
    if(tab[p+1]>tab[p])
    for(int i = 2 ; i <=nbr ; i++){
//        cout <<nbr<<"   " << i <<endl;
        mult*=nbr-i+1;
        mult%=M;
        r += ((p? mult:1ll)*solve(p+i,i) )%M;
        r%=M;
//        cout << r << endl;
        if(tab[p+i]<tab[p+i-1])break;
    }
    return r ;
}

int main()
{
    cin >> n ;
    for(int i = 0 ; i<n ; i++){
        cin >> tab[i];
    }
    tab[n]=-1;
    for(int i = 1 ; i<=n ; i++){
        fact[i][i] = i;
        C[i][0] = 1 ;
        C[i][i] = 1 ;
        for(int j = 1 ; j<i ; j++){
            C[i][j] = C[i-1][j-1]+C[i-1][j] ;
            C[i][j]%= M;

        }
        for(int j = i-1 ; j>0 ;j--){
            fact[i][j] = 1ll*fact[i][j+1]*j %M;
        }
    }
    memset(dp , -1 , sizeof dp);
    cout <<solve(0,n);
    return 0;
}