#include <bits/stdc++.h>
#include <tr1/unordered_map>
typedef long long ll;
typedef unsigned long long ull;
#define clr(ma) memset(ma,-1,sizeof ma)
#define inf 1000000000000000ll
#define vi vector<int>
#define pi pair<int  ,int >
#define T pair<pi,int>
#define mk make_pair
#define getBit(m,i) ((m&(1<<i))==(1<<i))
#define setBit(m,i) (m|(1<<i))
#define setBit2(m,i) (m|(1ull<<i))
#define cont(i,ma) ((ma.find(i))!=(ma.end()))
#define in(i) scanf("%d",&i)
#define in2(i,j) scanf("%d%d",&i,&j)
#define in3(i,j,k) scanf("%d%d%d",&i,&j,&k)
#define in4(i,j,k,l) scanf("%d%d%d%d",&i,&j,&k,&l)
#define il(i) scanf("%I64d",&i)
#define itr map<ll,ll>::iterator
#define itr2 map<ll,map<ll,ll> >::iterator
#define id(k) scanf("%9lf",&k)
#define fi(ss) freopen (ss,"r",stdin)
#define fo(ss) freopen (ss,"w",stdout)
#define clean(vis)  memset(vis,0,sizeof vis)
#define mo(x) ((x)<P?(x):(x)-P)
#define mo2(x) ((x)>=0?(x):(x)+P)
#define fast ios_base::sync_with_stdio(0);cin.tie(0);
#define sc(s)  scanf("%s",s)
using namespace std;
const int N=1200+5;
const ll M =1000*1000*1000+7;
ll P [N][N];
ll dp [N][N];
int a [N];
int d [N];
int n;
ll solve(int r,int id){
    if (id==n)return 1;
    ll & res=dp[r][id];
    if (res!=-1)return res;
    res=0;
    for (int i=1;i<=min((r==0?n:r),d[id]);i++){
        if (r==0){
            res+=solve(i,id+i);
            if (res>=M)res-=M;
        }
        else{
            res+=(P[r][i]*solve(i,id+i))%M;
            if (res>=M)res-=M;
        }
    }
    return res;

}
int main(){
    in(n);
    for (int i=1;i<=n;i++){
        for (int j=0;j<=i;j++){
            P[i][j]=(j==0)?1:((P[i][j-1]*(ll)(i-j+1))%M);
           // cout<<i<<" "<<j<<" "<<P[i][j]<<endl;
        }
    }
    for (int i=0;i<n;i++)in(a[i]);
    for (int i=0;i<n;i++){
        d[i]=1;
        for (int j=i+1;j<n;j++){
            if (a[j]>a[j-1])d[i]++;
            else break;
        }
       // cout<<d[i]<<endl;
    }

    clr(dp);
    cout<<solve(0,0)<<endl;

}