#include <bits/stdc++.h>

using namespace std;

long long Max1=1000000007;
long long **choose1;
int n;
void choose(){
    long long ans1=1;
    long long i,j;
    choose1=new long long*[n+1];
    for(i=1;i<=n;i++){
        ans1=1;
        choose1[i]=new long long[n+1];
        for(j=1;j<=i;j++){
        ans1*=(long long)(i-j+1);
        if(ans1>=Max1) ans1=ans1%Max1;
        choose1[i][j]=ans1;
        }
        
    }
}
int main(){
    
    cin >> n;
    vector<int> m(n+1);
    for(int m_i = 1; m_i <= n; m_i++){
       cin >> m[m_i];
    }
    int *a;
    a= new int[n+1];
    int num=1;
    int p1=n, p,st=0;
    a[1]=1;
    int st1=0;
    for(int i=2;i<=n;i++){
        if(m[i]>=m[i-1]){
            num++;
            if(p1<num){
               p=num/p1;
               if((num+(p-1))/p>p1) p++;
               a[i]=num/p;
            }
            else{
                a[i]=num;
            }
        }
        else{
            if(st1==0) a[0]=num;
            p1=a[i-1];
            num=1;
            a[i]=num;
            st1=1;
        }
    }
    if(st1==0) a[0]=num;
   
    long long **p2;
    int i;
    long long j,j1;
    
    p2=new long long*[n+1];
     //for(i=0;i<=n;i++) cout<<a[i]<<" ";
    for(i=0;i<=n;i++){
        p2[i]= new long long[a[i]+1];
        for(j=0;j<=a[i];j++) p2[i][j]=0;
    }
    choose();
    p2[0][0]=1;
    for(i=1;i<=a[0];i++){
        p2[i][i]=1;
    }
    for(i=1;i<n;i++){
        for(j=1;j<=a[i];j++){
            //cout<<i<<" "<<j<<" "<<p2[i][j]<<" ";
            if(p2[i][j]!=0){
                //cout<<j<<p2[i][j];
            for(j1=1;j1<=j;j1++){
            if(i+j1>n) break;
            if(j1!=1&&m[i+j1]<m[i+j1-1]) break;
            p2[i+j1][j1] = p2[i+j1][j1]+ p2[i][j]*choose1[j][j1];
            if(p2[i+j1][j1]>=Max1) p2[i+j1][j1]=p2[i+j1][j1]%Max1;
                
            }
            }
        }
    }
    //cout<<p2[2][2];
    //cout<<a[7]<<" "<<p2[5][2]<<p2[6][1]<<p2[6][3]<<p2[7][1];
        long long ans=0;
    for(i=1;i<=a[n];i++){
        if(p2[n][i]!=-1)
        ans+=p2[n][i];
        if(ans>=Max1) ans-=Max1;
    }
    cout<<ans;
    // your code goes here
    return 0;
}