#include <bits/stdc++.h>
#define pb push_back
#define sqr(x) (x)*(x)
#define sz(a) int(a.size())
#define reset(a,b) memset(a,b,sizeof(a))
#define oo 1000000007

using namespace std;

typedef pair<int,int> pii;
typedef long long ll;

const int maxn=1222;

ll dp[maxn][maxn],C[maxn][maxn],fac[maxn];
int n,a[maxn];

int main(){
//    freopen("input.txt","r",stdin);
    cin>>n;
    for(int i=1; i<=n; ++i) cin>>a[i];
    C[0][0]=1;
    fac[0]=1;
    for(int i=1; i<=n; ++i){
        C[i][0]=1;
        fac[i]=fac[i-1]*i%oo;
        for(int j=1; j<=i; ++j) C[i][j]=(C[i-1][j]+C[i-1][j-1])%oo;
    }

    for(int i=1; i<=n; ++i){
        if(i>1 && a[i]<a[i-1]) break;
        dp[i][i]=1;
    }
    for(int i=1; i<=n; ++i) for(int len=1; len<=i; ++len) if(dp[i][len]){
        for(int j=i+1; j<=n && j<=i+len; ++j){
            if(j>i+1 && a[j]<a[j-1]) break;
            int len2 = j-i;
            dp[j][len2] = (dp[j][len2] + dp[i][len]*C[len][len2]%oo*fac[len2])%oo;
        }
    }
    ll res = 0;
    for(int i=1; i<=n; ++i) res = (res + dp[n][i])%oo;
    cout<<res<<endl;
}