# include <iostream>
using namespace std;
typedef long long int ll;
const int maxn=1203;
const ll mod=1e9 +7;
int n,a[maxn],b[maxn];
ll cache[maxn][maxn];
ll dp[maxn][maxn];
bool vis[maxn][maxn];
ll fac[maxn];
ll C(int x,int y)
{
	if(x<y)return 0;
	if(y==0 or x==y)return 1;
	ll &res=cache[x][y];
	if(res)return res;
	return res=(C(x-1,y)+C(x-1,y-1))%mod;
}
inline ll P(int x,int y)
{
    if(x<y)return 0;
    ll tmp=C(x,y);
    tmp*=fac[y];
    if(tmp>=mod)tmp%=mod;
    return tmp;
}
ll f(int pos,int presz)
{
	if(pos==n+1)return 1;
	int up=min(presz,b[pos]-pos);
	ll &res=dp[pos][presz];
    if(vis[pos][presz])return res;
    vis[pos][presz]=true;
    res=0;
	for(int i=pos;i<pos+up;i++)
		res=(res+(P(presz,i-pos+1)*f(i+1,i-pos+1))%mod)%mod;
	return res;
}
int main()
{
	fac[0]=1;
	for(int i=1;i<maxn;i++)
		fac[i]=(fac[i-1]*(1ll*i))%mod;
	cin>>n;
	for(int i=1;i<=n;i++)
		cin>>a[i];
	b[n]=n+1;
	for(int i=n;i>=1;i--)
	{
		if(a[i]<a[i+1])
			b[i]=b[i+1];
		else
			b[i]=i+1;
		//cout<<i<<" "<<b[i]<<endl;
	}
	ll res=0;
    for(int i=1;i<b[1];i++)
        res=(res+f(i+1,i))%mod;
	cout<<res<<"\n";
	return 0;
}