#include <bits/stdc++.h>
#define inf (0x7f7f7f7f)
#define Min(a, b) ((a) < (b) ? (a) : (b))
#define Max(a, b) ((a) > (b) ? (a) : (b))
typedef long long ll;
using namespace std;
template <class T>
inline void read(T &x){
	int ch = 0, f = 0; x = 0;
	for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = 1;
	for(; isdigit(ch); ch = getchar()) x = x * 10 + ch - 48;
	if(f) x = -x;
}
const int N = 2e6 + 1e5, M = 1e9 + 9, M2 = 998244353, lim = 2e6 + 1e4, mod = 1e9 + 7;
int a[N], pw[N], pw2[N], pre2[N], pre[N], dp[N];
vector<int> stk[N];
pair<int, int> hsa[N], hsb[N];
int n;

#define fi first
#define se second

namespace seg{
	#define lson (u << 1)
	#define rson (u << 1 | 1)
	#define mid ((l + r) >> 1)
	pair<int, int> hash[N<<2];
	int low[N<<2], high[N<<2];
	inline void build(int u, int l, int r){
		hash[u] = make_pair(0, 0), low[u] = lim + 1, high[u] = 0;
		if(l == r) return;
		build(lson, l, mid), build(rson, mid + 1, r);
	}
	inline void update(int u, int l, int r){
		low[u] = min(low[lson], low[rson]);
		high[u] = max(high[lson], high[rson]);
		hash[u].fi = (hash[lson].fi + 1ll * hash[rson].fi * pw[mid-l+1] % M) % M;
		hash[u].se = (hash[lson].se + 1ll * hash[rson].se * pw2[mid-l+1] % M2) % M2;
	}
	inline void modify(int u, int l, int r, int pos, int x){
		if(l == r){
			if(x) low[u] = high[u] = l;
			else low[u] = n + 1, high[u] = 0;
			return (void) (hash[u] = make_pair(233 * x, 97 * x));
		}
		if(pos <= mid) modify(lson, l, mid, pos, x);
		else modify(rson, mid + 1, r, pos, x);
		update(u, l, r);
	}
	inline int query(int u, int l, int r, int pos){
		if(l == r) return hash[u].fi > 0 && hash[u].se > 0;
		if(pos <= mid) return query(lson, l, mid, pos);
		else return query(rson, mid + 1, r, pos);
	}
	inline void clear(int u, int l, int r){
		hash[u] = make_pair(0, 0), low[u] = lim + 1, high[u] = 0;
		if(high[lson]) clear(lson, l, mid);
		if(high[rson]) clear(rson, mid + 1, r);
	}
	#undef mid
}

inline void add_bit(int x){
	while(seg::query(1, 1, lim, x)){
		seg::modify(1, 1, lim, x, 0);
		x++;
	}
	seg::modify(1, 1, lim, x, 1);
}



inline void solve(int l, int r){
	if(l == r){
		stk[l].push_back(l);
		return;
	}

	int mid = ((l + r) >> 1);
	seg::clear(1, 1, lim);
	vector<pair<int, int> > vec;
	for(int i = mid; i >= l; i--){
		add_bit(a[i]);
		int val1 = seg::hash[1].fi, low = seg::low[1];
		int val2 = seg::hash[1].se;
		val1 = (val1 + (M - pw[low])) % M;
		val2 = (val2 + (M2 - pw2[low])) % M2;
		int bval = 1ll * pre[seg::high[1]-low] * pw[low] % M;
		int bval2 = 1ll * pre2[seg::high[1]-low] * pw2[low] % M2;
		bval = (bval + M - val1) % M;
		bval2 = (bval2 + M2 - val2) % M2;
		hsa[i] = make_pair(val1, val2), hsb[i] = make_pair(bval, bval2);
		vec.push_back(make_pair(low, i));
	}
	
	seg::clear(1, 1, lim);

	for(int i = mid + 1; i <= r; i++){
		add_bit(a[i]);
		int val1 = seg::hash[1].fi, low = seg::low[1];
		int val2 = seg::hash[1].se;
		
		val1 = (val1 + (M - pw[low])) % M;
		val2 = (val2 + (M2 - pw2[low])) % M2;
		
		int bval = 1ll * pre[seg::high[1]-low] * pw[low] % M;
		int bval2 = 1ll * pre2[seg::high[1]-low] * pw2[low] % M2;
		
		bval = (bval + M - val1) % M;
		bval2 = (bval2 + M2 - val2) % M2;
		
		hsa[i] = make_pair(val1, val2), hsb[i] = make_pair(bval, bval2);
		vec.push_back(make_pair(low, i));
	}

	sort(vec.begin(), vec.end());
			
	for(int i = 0, j; i < (int) vec.size();){
		vector<pair<pair<int, int>, int> > vecl, vecr;
		
		for(j = i; vec[j].fi == vec[i].fi && j < (int) vec.size(); j++){
			if(vec[j].se <= mid) vecl.push_back(make_pair(hsa[vec[j].se], vec[j].se));
			else vecr.push_back(make_pair(hsa[vec[j].se], vec[j].se));
		}		
		sort(vecl.begin(), vecl.end());
		sort(vecr.begin(), vecr.end());
		
		for(j = i; vec[j].fi == vec[i].fi && j < (int) vec.size(); j++){
			pair<int, int> val = hsb[vec[j].se];
			if(vec[j].se <= mid){
				int L = lower_bound(vecr.begin(), vecr.end(), make_pair(val, 0)) - vecr.begin();
				int R = lower_bound(vecr.begin(), vecr.end(), make_pair(val, inf)) - vecr.begin() - 1;
				for(int k = L; k <= R; k++) stk[vecr[k].se].push_back(vec[j].se);
			}
			else{
				int L = lower_bound(vecl.begin(), vecl.end(), make_pair(val, 0)) - vecl.begin();
				int R = lower_bound(vecl.begin(), vecl.end(), make_pair(val, inf)) - vecl.begin() - 1;
				for(int k = L; k <= R; k++) stk[vec[j].se].push_back(vecl[k].se);
			}
		}
		i = j;
	}
	
	
	solve(l, mid);
	solve(mid + 1, r);

}


int main(){
	read(n);
	for(int i = 1; i <= n; i++) read(a[i]), a[i]++;
	pw[0] = pw2[0] = 1;
	for(int i = 1; i <= lim; i++){
		pw[i] = 233ll * pw[i-1] % M;
		pw2[i] = 97ll * pw2[i-1] % M2;
		pre[i] = (pre[i-1] + pw[i]) % M;
		pre2[i] = (pre2[i-1] + pw2[i]) % M2;
		
	}
	seg::build(1, 1, lim);
	solve(1, n);
	
	dp[0] = 1;
	for(int i = 1; i <= n; i++){
		sort(stk[i].begin(), stk[i].end());
		for(int j = 0; j < (int) stk[i].size(); j++){
			if(j == 0 || stk[i][j] != stk[i][j-1]){
				dp[i] = (dp[i] + dp[stk[i][j]-1]) % mod;
			}
		}
	}
	cout << dp[n] << endl;
	return 0;
}