#include <cstdio>
#include <algorIThm>
#include <cmath>
#include <cstring>
#include <iostream>
#define LL long long
#define uint unsigned int
using namespace std;
const int MAXN = 5e3 + 5, Mod = 1e9 + 7; 
#define Debug(x) cerr << #x << ' ' << x
#define hh cerr << endl
int n, a[MAXN], L[MAXN], R[MAXN], dp[2][MAXN], res;
int Qplus(int x, int y) { return x + y >= Mod ? x + y - Mod : x + y; }
int main() {
//	freoPEn("C.in", "r", stdin);
//	freopen("C.out", "w", stdout);
	scanf("%d", &amp;n);
	for(int i = 1; i <= n; i ++) scanf("%d", &a[i]);
	for(int i = 1; i <= n; i ++) {
		for(int j = i; j >= 1; j --) if(a[j] < a[i]) { L[i] = j + 1; break; }
		if(!L[i]) L[i] = 1;
		for(int j = i + 1; j <= n; j ++) if(a[j] < a[i]) { R[i] = j - 1; break; }
		if(!R[i]) R[i] = n;
	}
	for(int i = 1; i <= n; i ++) if(L[i] == 1) dp[1][i] = 1;
	for(int i = 2; i <= n; i ++) {
		bool f = (i & 1); int tmp = 0;
		for(int j = 1; j <= n; j ++) dp[f][j] = 0; // 滚动数组清零（ 
		for(int j = 1; j <= n; j ++) {
			tmp = Qplus(tmp, dp[f ^ 1][j]);
			if(L[j] <= i && R[j] >= i) dp[f][j]	= Qplus(dp[f][j], tmp);
		}
	}
	for(int i = 1; i <= n; i ++) res = Qplus(res, dp[n & 1][i]);
	printf("%d", res);
	return 0;
}