/* -.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.-.
 * Created By : Aditya Agarwal
 * IT, MNNIT-ALLAHABAD 
 * aditya.mnnit15@gmail.com
 _._._._._._._._._._._._._._._._._._._._._.*/


#include<bits/stdc++.h>
using namespace std;

#define MP make_pair
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,a,b) for(int i=a;i<=b;i++)
#define PER(i,a,b) for(int i=b;i>=a;i--)
#define X first
#define Y second

 //i/o
#define inp(n) scanf("%d",&n)
#define inpl(n) scanf("%lld",&n)
#define inp2(n,m) inp(n), inp(m)
#define inp2l(n,m) inpl(n), inpl(m)


//cost
#define MOD 1000000007
#define MOD_INV 1000000006
#define MAX 100009
#define INF 999999999
#define mp make_pair
typedef long long ll;
typedef pair< pair<ll,ll>,ll > pairs;

int n;
int a[1205],is[1205],cum[1205];
ll dp[1205][1205],fact[1205],ifact[1205];

ll powd(ll base,int ex){
    ll res=1;
    while(ex){
        if(ex%2==1)
            res=(res*base)%MOD;
        ex/=2;
        base=(base*base)%MOD;
    }
    return res;
}

ll comp(int n,int r){
    ll ans=fact[n];
    ans=(ans*ifact[n-r])%MOD;
    //cout<<n<<" "<<r<<" "<<fact[n]<<" "<<ifact[r]<<" "<<ifact[n-r]<<" "<<ans<<endl;
    return ans;
}

ll func(int pos,int prev){
    if(pos==n+1)
        return 1;
    if(dp[pos][prev]!=-1)
        return dp[pos][prev];
    ll ans=0;
    for(int i=1;i<=prev && pos+i-1<=n ;i++){
        if(cum[pos+i-1]-cum[pos-1]-is[pos]!=0)
            break;
        else if(pos!=1)
            ans=(ans+(comp(prev,i)*func(pos+i,i))%MOD)%MOD;
        else
            ans=(ans+func(pos+i,i))%MOD;
    }
    return dp[pos][prev]=ans;
}

int main(){
    inp(n);
    fact[0]=fact[1]=1;
    REP(i,2,1204)
        fact[i]=(i*fact[i-1])%MOD;
    ifact[1204]=powd(fact[1204],MOD-2);
    for(int i=1203;i>=0;i--){
        ifact[i]=((i+1)*ifact[i+1])%MOD;
    }
    REP(i,1,n){
        inp(a[i]);
    }

    REP(i,2,n){
        if(a[i]<a[i-1])
            is[i]=1;
    }

    REP(i,1,n){
        cum[i]=cum[i-1]+is[i];
    }

    memset(dp,-1,sizeof(dp));
    ll ways=func(1,n+1);
    printf("%lld\n",ways);

    return 0;
}