#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;

typedef long long ll;

const ll mod = 1e9 + 7;
const ll seed = 31;
const int N = 3e5 + 50;
const ll P = (1ll << 61) - 1;

int n, a[N];
ll coef[N << 1], sum[N << 1];
int pre[N], suf[N];
unordered_map<ll, int> vis;
int sta[N << 1], top;
vector<int> seq[N];
ll f[N];
int flag[N];

void calc(int l, int r, int d) {
    if (l == r) {
        seq[r].push_back(l);
        return;
    }
    int mid = (l + r) >> 1;
    calc(l, mid, d);
    calc(mid + 1, r, d);

    ll sufhash = 0;
    for (int i = mid; i >= l; i--) {
        int cur = a[i];
        while (suf[cur]) {
            suf[cur] = 0;
            sufhash = (sufhash - coef[cur] + P) % P;
            cur++;
        }
        suf[cur] = 1;
        sufhash = (sufhash + coef[cur]) % P;
        sta[++top] = cur;
        vis[sufhash] = i;
    }
    while (top)
        suf[sta[top--]] = 0;

    ll prehash = 0;
    int minn = N, maxn = 0;
    for (int i = mid + 1; i <= r; i++) {
        int cur = a[i];
        while (pre[cur]) {
            pre[cur] = 0;
            prehash = (prehash - coef[cur] + P) % P;
            cur++;
        }
        pre[cur] = 1;
        maxn = max(maxn, cur);
        minn = min(minn, cur);
        while (!pre[minn])
            minn++;
        prehash = (prehash + coef[cur]) % P;
        sta[++top] = cur;

        ll val = sum[maxn];
        if (minn)
            val = (val - sum[minn - 1] + P) % P;
        val = (val + coef[minn]) % P;
        val = (val - prehash + P) % P;
        if (vis.count(val)) {
            if (d)
                seq[n - vis[val] + 1].push_back(n - i + 1);
            else
                seq[i].push_back(vis[val]);
        }
    }
    while (top)
        pre[sta[top--]] = 0;

    vis.clear();
}

void solve() {
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i];

    ll mul = 1;
    for (int i = 0; i < (N << 1); i++)
        coef[i] = i;
    random_shuffle(coef + 1, coef + N);
    for (int i = 0; i < (N << 1); i++) {
        coef[i] = coef[i] * mul % mod;
        sum[i] = coef[i];
        if (i)
            sum[i] = (sum[i] + sum[i - 1]) % mod;
        mul = mul * seed % mod;
    }

    calc(1, n, 0);
    reverse(a + 1, a + n + 1);
    calc(1, n, 1);

    f[0] = 1;
    for (int i = 1; i <= n; i++) {
        for (auto j : seq[i]) {
            if (flag[j])
                continue;
            f[i] = (f[i] + f[j - 1]) % mod;
            flag[j] = 1;
        }
        for (auto j : seq[i])
            flag[j] = 0;
    }
    cout << f[n] << "\n";
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}