#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
#define INF 1e18
#define pb push_back
#define pi pair<ll,ll>
ll n;
ll a[1210];
ll dp[1210][1210];
ll c[1210][1210];
ll fact[1210];
ll sam[1210];
ll power(ll a,ll b,ll p)
{
	ll res=1;
	while(b)
	{
		if(b&1)
			res=(res*a)%p;
		b/=2;
		a=(a*a)%p;
	}
	return res;
}
ll C(ll n,ll r)
{
	if(c[n][r]!=-1)
		return c[n][r];
	if(r>n)
		return 0;
	return c[n][r]=(fact[n]*power(fact[n-r],MOD-2,MOD))%MOD;
}
ll find(ll curr,ll prev)
{
	if(curr==n)
	{
		return 1;
	}
	if(dp[curr][prev]!=-1)
		return dp[curr][prev];
	dp[curr][prev]=0;
	for(int i=curr;i<min(curr+prev,n);i++)
	{
		if(sam[i]==sam[curr])
		{
			// cout<<i<<" "<<C(prev,i-curr+1)<<endl;
			dp[curr][prev]=(dp[curr][prev]+(C(prev,i-curr+1)*find(i+1,i-curr+1))%MOD)%MOD;
		}
		else
		{
			break;
		}
	}
	// cout<<curr<<" "<<prev<<" "<<dp[curr][prev]<<endl;
	return dp[curr][prev];
}
int main()
{
	cin>>n;
	fact[0]=1;
	for(ll i=1;i<=n;i++)
	{
		fact[i]=(i*fact[i-1])%MOD;
	}
	for(int i=0;i<n;i++)
	{
		cin>>a[i];
	}
	sam[0]=0;
	for(int i=1;i<n;i++)
	{
		if(a[i]<a[i-1])
		{
			sam[i]=sam[i-1]+1;
		}
		else
		{
			sam[i]=sam[i-1];
		}
	}
	for(int i=0;i<=n;i++)
	{
		for(int j=0;j<=n;j++)
		{
			dp[i][j]=-1;
			c[i][j]=-1;
		}
	}
	ll ans=0;
	for(int i=0;i<n;i++)
	{
		if(sam[i]==sam[0])
		{
			ans=((ans+find(i+1,i+1))%MOD)%MOD;
		}
		else
		{
			break;
		}
	}
	cout<<ans<<endl;
}