#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define pb push_back
#define mp make_pair

#define MAXN 300'010

#define MAXM 1'000'010

const ll mod = 1e9 + 7;

int n;

int a[MAXN];
vi hasthing[MAXM];

vi intervals[MAXN];

int memo[MAXN][2];

ll mem[MAXN];


int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);

	cin >> n;
	rep(i, 0, n) {
		cin >> a[i];
		hasthing[a[i]].pb(i);
	}

	vi poss;
	vi poss2;
	rep(i, 0, n) rep(j, 0, 2) memo[i][j] = -1;
	rep(i, 0, n) {
		if (a[i] == 0) {
			memo[i][0] = i;
			poss.pb(i);
			intervals[i].pb(i);
		}
	}

	rep(amt, 1, MAXM) {
		int ind = amt % 2;
		int prevind = (ind+1)%2;

		poss2.clear();

		for (int x : hasthing[amt]) {
			memo[x][ind] = x;
			poss2.pb(x);
			intervals[x].pb(x);
		}

		for (int x : poss) {
			int ending = memo[x][prevind];
			if (ending < n-1 && memo[ending+1][prevind] != -1) {
				poss2.pb(x);
				memo[x][ind] = memo[ending+1][prevind];
				intervals[memo[ending+1][prevind]].pb(x);
			}
		}


		for (int x : poss) {
			memo[x][prevind] = -1;
		}

		poss = poss2;	
	}


	rep(i, 0, n) {
		mem[i] = 0;
		for (int x : intervals[i]) {
			if (x == 0) {
				mem[i] += 1;
				mem[i] %= mod;
			} else {
				mem[i] += mem[x-1];
				mem[i] %= mod;
			}
		}
	}
	cout << mem[n-1] << endl;
	

}