#include<bits/stdc++.h>
using namespace std;
int dp[1500][1500],a[1500],fac[1500],inv[1500];
bool sor[1500][1500];
int mod=1000000007,n;
typedef long long ll;
long long pow(int a, int b, int MOD)
{
    long long x=1,y=a;
    while(b > 0)
    {
        if(b%2 == 1)
        {
            x=(x*y);
            if(x>MOD) x%=MOD;
        }
        y = (y*y);
        if(y>MOD) y%=MOD;
        b /= 2;
    }
    return x;
}
int rec(int i,int j){
    if(dp[i][j]!=-1){
        //cout<<i<<" "<<j<<" "<<"memo "<<dp[i][j]<<endl;
        return dp[i][j];
    }
    if(i-j+1 <=0 || !sor[i-j+1][i]) return dp[i][j]=0;
    int ret=0;
    for(int it=j;it<=i-j;it++){
        int temp=rec(i-j,it);
        if(temp==0) continue;
        temp=(1LL*fac[it]*temp)%mod;
       // cout<<i<<" "<<j<<" "<<rec(i-j,it)<<endl;
        ret+=(1LL*inv[it-j]*temp)%mod;
        if(ret>=mod)
            ret-=mod;
    }
   // cout<<i<<" "<<j<<" "<<"bd "<<ret<<endl;
    return dp[i][j]=ret;
}
int main(){
    int i,j;
    scanf("%d",&n);

    fac[0]=inv[0]=1;
    for(i=1;i<=n;i++){
        fac[i]=(1LL*i*fac[i-1])%mod;
        inv[i]=pow(fac[i],mod-2,mod);
    }
    memset(dp,-1,sizeof(dp));
    for(i=1;i<=n;i++){
        scanf("%d",a+i);
       //a[i]=i;
        sor[i][i]=1;
    }
    for(i=1;i<=n;i++){
        j=i+1;
        while(j<=n){
            if(a[j]>=a[j-1])
                sor[i][j]=true;
            else
                break;
            j++;
        }
    }
    for(i=0;i<=n;i++){
        dp[0][i]=1;
        if(sor[1][i])
            dp[i][i]=1;
    }
    int  ans=0;
    for(i=1;i<=n;i++){
        ans+=rec(n,i);
       // cout<<i<<" "<<rec(n,i)<<endl;
        if(ans>=mod)
            ans-=mod;
    }
    printf("%d",ans);
}