#include <vector>
#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;
const int mod = 1000000007;
const int inf = 1012345678;
int sz, seg[524295];
void update(int pos, int val) {
	pos += sz;
	seg[pos] = val;
	while (pos > 1) {
		pos >>= 1;
		seg[pos] = max(seg[pos * 2], seg[pos * 2 + 1]);
	}
}
int query(int a, int b, int k, int l, int r) {
	if (r <= a || b <= l) return -inf;
	if (a <= l && r <= b) return seg[k];
	int lc = query(a, b, k * 2, l, (l + r) >> 1);
	int rc = query(a, b, k * 2 + 1, (l + r) >> 1, r);
	return max(lc, rc);
}
int N, bit[200009];
void add(int pos, int val) {
	for (int i = pos + 1; i <= N; i += i & (-i)) {
		bit[i] += val;
	}
}
int sum(int r) {
	int ans = 0;
	for (int i = r; i >= 1; i -= i & (-i)) {
		ans += bit[i];
	}
	return ans;
}
int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);
	cin >> N;
	vector<int> A(N);
	for (int i = 0; i < N; ++i) {
		cin >> A[i];
	}
	vector<int> perm(N);
	for (int i = 0; i < N; ++i) {
		perm[i] = i;
	}
	sort(perm.begin(), perm.end(), [&](int i, int j) { return A[i] != A[j] ? A[i] < A[j] : i > j; });
	sz = 1;
	while (sz < N) sz *= 2;
	vector<int> dp(N);
	for (int i = 0; i < N; ++i) {
		dp[perm[i]] = query(0, perm[i], 1, 0, sz) + 1;
		if (dp[perm[i]] <= 0) dp[perm[i]] = 1;
		update(perm[i], dp[perm[i]]);
	}
	vector<int> p2(N);
	for (int i = 0; i < N; ++i) {
		p2[i] = i;
	}
	sort(p2.begin(), p2.end(), [&](int i, int j) { return dp[i] != dp[j] ? dp[i] < dp[j] : i < j; });
	vector<int> p2inv(N);
	for (int i = 0; i < N; ++i) {
		p2inv[p2[i]] = i;
	}
	vector<int> seq(N + 1, inf);
	for (int i = 0; i < N; ++i) {
		seq[dp[i]] = min(seq[dp[i]], p2inv[i]);
	}
	vector<int> ways(N);
	for (int i = 0; i < N; ++i) {
		if (dp[perm[i]] == 1) {
			ways[perm[i]] = 1;
		}
		else {
			int cl = seq[dp[perm[i]] - 1] - 1, cr = seq[dp[perm[i]]];
			while (cr - cl > 1) {
				int cm = (cl + cr) >> 1;
				if (p2[cm] >= perm[i]) cr = cm;
				else cl = cm;
			}
			ways[perm[i]] = sum(cr) - sum(seq[dp[perm[i]] - 1]) + mod;
			if (ways[perm[i]] >= mod) ways[perm[i]] -= mod;
		}
		add(p2inv[perm[i]], ways[perm[i]]);
	}
	int len = *max_element(dp.begin(), dp.end());
	int ans = 0;
	for (int i = 0; i < N; ++i) {
		if (dp[i] == len) {
			ans += ways[i];
			if (ans >= mod) ans -= mod;
		}
	}
	cout << ans << endl;
	return 0;
}