#include <bits/stdc++.h>
#pragma GCC optimize(3)
using namespace std;
typedef long long ll;
const int N = 1000040;
const int mod = 1e9 + 7;
const int mod1 = 1e9 + 7, mod2 = 1e9 + 9;
int n, a[N];
int ba1[N], ba2[N];
int sum1[N], sum2[N];
int st[N][19], lg[N];
int f[N];
vector<int> t[N];
int stal[N], topl;
int star[N], topr;
map<ll, int> ma;

int find_max(int l, int r) {
	int k = lg[r - l + 1];
	int x = st[l][k], y = st[r - (1 << k) + 1][k];
	return max(a[x], a[y]);
}
void solve(int l, int r) {
	if(l >= r) {
		t[r].push_back(l - 1);
		return ;
	}
	int mid = (l + r) >> 1;
	solve(l, mid), solve(mid + 1, r);
	int mx = 0;
	for(int i = mid; i >= l; i--) {
		mx = max(mx, a[i]);
		for(int j = 1; j <= 18; j++) {
			int s1 = (sum1[i - 1] + ba1[mx + j]) % mod1;
			int s2 = (sum2[i - 1] + ba2[mx + j]) % mod2;
			if(ma.find(1ll * s1 * mod2 + s2) == ma.end()) continue;
			int x = ma[1ll * s1 * mod2 + s2];
			if(x <= mid || x > r) continue;
			int tmp = find_max(i, x);
			if(tmp != mx) continue;
			t[x].push_back(i - 1);
		}
	}
	mx = 0;
	for(int i = mid + 1; i <= r; i++) {
		mx = max(mx, a[i]);
		for(int j = 1; j <= 18; j++) {
			int s1 = (sum1[i] - ba1[mx + j] + mod1) % mod1;
			int s2 = (sum2[i] - ba2[mx + j] + mod2) % mod2;
			if(ma.find(1ll * s1 * mod2 + s2) == ma.end()) continue;
			int x = ma[1ll * s1 * mod2 + s2];
			if(x >= mid || x < l - 1) continue;
			int tmp = find_max(x + 1, i);
			if(tmp != mx) continue;
			t[i].push_back(x);
		}
	}
}
int main() {
	// freopen("K.in", "r", stdin);
	ios::sync_with_stdio(0); cin.tie(nullptr);
	cin >> n;
	for(int i = 1; i <= n; i++) cin >> a[i];
	lg[0] = -1;
	for(int i = 1; i <= n; i++) lg[i] = lg[i >> 1] + 1;
	for(int i = 1; i <= n; i++) st[i][0] = i;
	for(int j = 1; (1 << j) <= n; j++)
		for(int i = 1; i + (1 << j) - 1 <= n; i++) {
			if(a[st[i][j - 1]] > a[st[i + (1 << (j - 1))][j - 1]])
				st[i][j] = st[i][j - 1];
			else st[i][j] = st[i + (1 << (j - 1))][j - 1];
		}
	ba1[0] = ba2[0] = 1;
	for(int i = 1; i <= 1000020; i++) {
		ba1[i] = 1ll * ba1[i - 1] * 2 % mod1;
		ba2[i] = 1ll * ba2[i - 1] * 2 % mod2;
	}
	for(int i = 1; i <= n; i++) {
		sum1[i] = (sum1[i - 1] + ba1[a[i]]) % mod1;
		sum2[i] = (sum2[i - 1] + ba2[a[i]]) % mod2;
	}
	for(int i = 0; i <= n; i++) {
		ma[1ll * sum1[i] * mod2 + sum2[i]] = i;
	}
	solve(1, n);
	f[0] = 1;
	for(int i = 1; i <= n; i++) {
		sort(t[i].begin(), t[i].end());
		t[i].resize(unique(t[i].begin(), t[i].end()) - t[i].begin());
		// for(auto v : t[i]) cout << v + 1 << " " << i << "\n";
		for(auto v : t[i]) f[i] = (f[i] + f[v]) % mod;
	}
	cout << f[n] << "\n";
	return 0;
}