#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,a[510],dp[510][510];
const int mod=1e9+7;
signed main(){
	cin>>n;
	for(int i=1;i<=n;i++) cin>>a[i],dp[i][i]=1;
	for(int len=2;len<=n;len++){
		for(int l=1;l+len-1<=n;l++){
			int r=l+len-1;
			for(int k=l+1;k<=r;k++) if(k==r || a[k+1]>a[l+1]) dp[l][r]=(dp[l][r]+dp[l+1][k]*dp[k][r])%mod;
		}
	}
	cout<<dp[1][n];
	return 0;
}