#include <bits/stdc++.h>
 
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define all(v) (v).begin(),(v).end()
 
#define PII pair<int,int>
#define mp make_pair
#define st first
#define nd second
#define pb push_back
#define lint long long int
#define VI vector<int>
 
#define debug(x) {cerr <<#x <<" = " <<x <<endl; }
#define debug2(x,y) {cerr <<#x <<" = " <<x << ", "<<#y<<" = "<< y <<endl; } 
#define debug3(x,y,z) {cerr <<#x <<" = " <<x << ", "<<#y<<" = "<< y << ", " << #z << " = " << z <<endl; } 
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<endl; }}
#define debugt(t,n) {{cerr <<#t <<" = "; FOR(it,0,(n)) cerr <<t[it] <<", "; cerr <<endl; }}
 
#define make( x) int (x); scanf("%d",&(x));
#define make2( x, y) int (x), (y); scanf("%d%d",&(x),&(y));
#define make3(x, y, z) int (x), (y), (z); scanf("%d%d%d",&(x),&(y),&(z));
#define make4(x, y, z, t) int (x), (y), (z), (t); scanf("%d%d%d%d",&(x),&(y),&(z),&(t));
#define makev(v,n) VI (v); FOR(i,0,(n)) { make(a); (v).pb(a);} 
#define IOS ios_base::sync_with_stdio(0)
#define HEAP priority_queue
 
#define read( x) scanf("%d",&(x));
#define read2( x, y) scanf("%d%d",&(x),&(y));
#define read3(x, y, z) scanf("%d%d%d",&(x),&(y),&(z));
#define read4(x, y, z, t) scanf("%d%d%d%d",&(x),&(y),&(z),&(t));
#define readv(v,n) FOR(i,0,(n)) { make(a); (v).pb(a);}
#define jeb fflush(stdout)

 
using namespace std;

const int max_n = 1205;

const int mod = 1e9 + 7;

int len[max_n];
int dp[max_n][max_n];
int newton[max_n][max_n];
int fac[max_n];

int main() {
	make(n);
	makev(v, n);
	fac[0] = 1;
	FOR(i,1,n+1) fac[i] = (fac[i-1] * 1LL * i) % mod;
	len[n-1] = 1;
	FORD(i, n-2, 0) {
		if (v[i] < v[i+1]) len[i] = len[i+1]+1;
		else len[i] = 1;
	}
	FOR(i,0,n+1) newton[i][i] = newton[i][0] = 1;
	FOR(i,2,n+1) FOR(j,1,i) newton[i][j] = (newton[i-1][j] + newton[i-1][j-1]) % mod;
	dp[n][0] = 1;
	FORD(i,n-1,0) {
		FOR(k,1,len[i]+1) {
			int loc = 0;
			FOR(l,0,k+1) {
				loc += (((newton[k][l] * 1LL * fac[l]) % mod) * 1LL * dp[i+k][l])%mod;
				loc %= mod;
			}
			dp[i][k] = loc;
		}
	}
	int ans = 0;
	FOR(i,0,n+1)  ans = (ans + dp[0][i]) % mod;
	printf("%d\n", ans);
}