/* i have a dream */
#include<bits/stdc++.h>
using namespace std;

#define trace(x) {cerr << #x << "=" << x <<endl;}
#define trace2(x, y) {cerr << #x << "=" << x << " " << #y << "=" << y <<endl;}
#define trace3(x, y,z) {cerr << #x << "=" << x << " " << #y << "=" << y <<" " << #z << "=" <<z<<endl;}
/*
template <typename T> ostream& operator<<(ostream& os, const vector<T> &p){os << "[ "; for (T x: p) os << x << " "; os << "]" << endl; return os;}
template <typename T> ostream& operator<<(ostream& os, const set<T> &p){os << "{ "; for (T x: p) os << x << " "; os << "}" << endl; return os;}
template <typename Tk, typename Tv> ostream& operator<<(ostream& os, const map<Tk, Tv> &p){os << "{ "; for (pair<Tk, Tv> x: p) os << x << " "; os << "}" << endl; return os;}
template <typename Tk, typename Tv> ostream& operator<<(ostream& os, const pair<Tk, Tv> &p){os << "{" << p.first << ',' << p.second << "}";return os;}
*/
#define pi pair<int,int>
#define pipi pair<int,pair<int,int> >
#define fi first
#define se second

const int MAX=2017;
long long dp[MAX][MAX],n,a[MAX],f[MAX],I[MAX];
const long long mod=1e9+7;
long long sum;
bool sorted[MAX];

long long Exp(long long a,long long b)
{
if(b==0)
return 1;
if(b==1)
return a;
long long temp=a;
long long val=Exp(a,b/2);
val=(val*val)%mod;
if(b%2==1)
val=(val*a)%mod;
return val;
}

void gen()
{
for(int i=1;i<=n;i++)
{
I[i]=Exp(f[i],mod-2);
for(int j=1;j<i;j++)
{

for(int k=j;k<=i-j;k++)
{
long long temp=f[k];
temp=temp*I[k-j];
temp=temp%mod;
dp[i][j]+=(temp*(long long)dp[i-j][k])%mod;
dp[i][j]=dp[i][j]%mod;
//cout<<dp[i][j]<<endl;
}
if(a[i-j]>a[i-j+1])
break;
}
dp[i][i]=sorted[i];
}
//for(int i=1;i<=n;i++)
//cout<<dp[n][i]<<" ";
//cout<<endl;

//sum=accumulate(dp[n]+1,dp[n]+1+n,sum);
//sum=sum%mod;

}

int main()
{
ios_base::sync_with_stdio(false);
cin>>n;
f[0]=I[0]=1;
sorted[0]=true;
for(int i=1;i<=n;i++)
{
cin>>a[i];
f[i]=((long long)i*f[i-1])%mod;
sorted[i]=sorted[i-1]&(a[i]>=a[i-1]);
}
gen();
for(int i=1;i<=n;i++)
sum+=dp[n][i];
sum=sum%mod;
cout<<sum<<endl;
return 0;
}