/*********** [ scopeInfinity ] ******************/
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef std::vector<ll> vll;
typedef std::vector<int> vi;

#define endl '\n' 
#define mp make_pair
#define pb(x) push_back((x))
#define what_is(x) cerr << #x << " is " << x << endl;

ll MOD = 1e9+7;
ll INF = LLONG_MAX;

vector<string> &split(const std::string &s, char delim, vector<string> &e) {
    stringstream ss(s);
    string item;
    while(getline(ss, item, delim))
        e.push_back(item);
    return e;
}


ll Pow(ll a ,ll b ,ll Mo){
    ll ans = 1;
    for (; b; b >>= 1, a = a * a % Mo)
        if (b&1) ans = ans * a % Mo;
    return ans;
}

vector<int> Zfunc(string &s) {
    int n=s.length();
    vector<int> z(n,0);
    for(int i=1,l=0,r=0;i<n;i++) {
        if(i<=r) 
            z[i] = min(z[i-l],r-i+1);
        while(i+z[i]<n && s[i+z[i]]==s[z[i]])
            z[i]++;
        if(r<i+z[i]-1)
            l=i,r=i+z[i]-1;
    }
    return z;
}

ll solve() {
	
	
	return 0;
}

std::vector<int> cI;

std::vector<ll> FAC,FACI;
std::vector<std::vector<int> > DP;
int getVal(int num,int mx,int first,int index) {
	if(num==0)
		return 1;
	int &ans = DP[index][mx];
	if(ans!=-1)
		return ans;
	ans=0;
	int M=min(min(num,mx),cI[index]);
	for (int i = 1; i <= M; ++i)
	{
		ll sol = getVal(num-i,i,0,index+i);
		if(!first)
			sol=(sol*FAC[mx])%MOD*FACI[mx-i]%MOD;
		ans = (ans+sol)%MOD;
		// cout<<num<<" "<<mx<<" "<<first<<"\t "<<i<<":"<<sol<<endl;
	}
	return ans;
}
	
int main(int argc, char const *argv[])
{
	std::ios::sync_with_stdio(false);cin.tie(0);
	// cout<<fixed<<setprecision(1);
	
	ll N;
	cin>>N;
	FAC=std::vector<ll> (N+1,1);
	FACI=std::vector<ll> (N+1,1);
	for (int i = 1; i <= N; ++i)
	{
		FAC[i]=(FAC[i-1]*i)%MOD;
	}
	for (int i = 0; i <= N; ++i)
	{
		FACI[i]=Pow(FAC[i],MOD-2,MOD);
	}
	DP=std::vector<std::vector<int> >(N+1,std::vector<int>(N+1,-1));
	std::vector<ll> num(N);
	for (int i = 0; i < N; ++i)
	{
		cin>>num[i];
	}
	cI=	std::vector<int> (N,1);

	for (int i = N-2; i >= 0; --i)
	{
		if(num[i+1]>num[i])
			cI[i]=1+cI[i+1];
	}
	cout<<getVal(N,N,1,0);


	return 0;
}