#include <bits/stdc++.h>
#define fr first
#define sc second
#define all(a) (a).begin(), (a).end()

using namespace std;

#ifdef ONPC
mt19937 rnd(223);
mt19937_64 rnd64(223);
#else
mt19937 rnd(chrono::high_resolution_clock::now()
            .time_since_epoch().count());
mt19937_64 rnd64(chrono::high_resolution_clock::now()
            .time_since_epoch().count());
#endif

#define TIME (clock() * 1.0 / CLOCKS_PER_SEC)

using ll = long long;
using ld = double;

const ll llinf = 1e18 + 100;

const int maxn = 1e6 + 100, inf = 1e9 + 100;

int n;

#define hash maksim
ll hash[maxn];
int a[maxn];

vector<int> e[maxn];

ll p[maxn];

int f[maxn];

ll S;
int big, sm;

void add(int v) {
    sm = min(sm, v);
    big = max(big, v);
    while (1) {
        S ^= hash[v];
        f[v] = !f[v];
        if (f[v]) {
            big = max(big, v);
            return;
        }
        if (sm == v)
            sm++;
        v++;
    }
}

unordered_map<ll, int> q;

void clear() {
    for (int i = sm; i <= big; i++)
        f[i] = 0;
    big = 0;
    sm = inf;
    S = 0;
}

void calc(int l, int r) {
    if (l == r)
        return;
    int m = (l + r) / 2;
    for (int i = m; i >= l; i--) {
        add(a[i]);
        // cerr << S << ' ' << i << '\n';
        assert(q.find(S) == q.end());
        q[S] = i;
    }
    clear();
    for (int i = m + 1; i <= r; i++) {
        add(a[i]);
        ll h = p[big + 1] ^ p[sm + 1] ^ S;
        if (q.find(h) != q.end())
            e[q[h]].push_back(i + 1);
    }
    q.clear();
    clear();
    for (int i = m + 1; i <= r; i++) {
        add(a[i]);
        // cerr << S << ' ' << i << '\n';
        assert(q.find(S) == q.end());
        q[S] = i;
    }
    clear();
    for (int i = m; i >= l; i--) {
        add(a[i]);
        ll h = p[big + 1] ^ p[sm + 1] ^ S;
        if (q.find(h) != q.end())
            e[i].push_back(q[h] + 1);
    }
    q.clear();
    clear();
    calc(l, m);
    calc(m + 1, r);
}

const int mod = 1e9 + 7;

void solve() {
    q.reserve(1e6);
    clear();
    for (int i = 0; i < maxn - 1; i++) {
        hash[i] = rnd64();
        p[i + 1] = p[i] ^ hash[i];
    }
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        e[i].push_back(i + 1);
    }
    calc(0, n - 1);
    vector<int> dp(n + 1);
    dp[0] = 1;
    for (int i = 0; i < n; i++) {
        unordered_set<int> g{all(e[i])};
        for (int j : g) {
            // cerr << i << ' ' << j - 1 << '\n';
            dp[j] = (dp[j] + dp[i]) % mod;
        }
    }
    cout << dp[n] << '\n';
}

int main() {
#ifdef ONPC
    freopen("../a.in", "r", stdin);
    // freopen("../a.out", "w", stdout);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout << fixed;
    cout.precision(20);
    int ts = 1;
    // cin >> ts;
    while (ts--)
        solve();
    cerr << "\n\nConsumed " << TIME << endl;
}