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

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 3e5;
const int MAXM = 1e6+30;

int N, A[MAXN+10];

const int MOD = 1e9+7;
struct mint
{
    int x;
    mint() : x(0) {}
    mint(int _x) : x(_x) {}
    mint operator + (int ot) const { return x+ot >=MOD ? x+ot-MOD : x+ot; }
    mint operator - (int ot) const { return x<ot ? x+MOD-ot : x-ot; }
    mint operator - () const { return x ? MOD-x : 0; }
    mint operator * (int ot) const { return 1ll*ot*x%MOD; }
    mint operator += (int ot) { return *this = *this + ot; }
    mint operator -= (int ot) { return *this = *this - ot; }
    mint operator *= (int ot) { return *this = *this * ot; }
    operator int() const { return x; }
};

mint mpow(mint x, int a)
{
    mint ret=1;
    while(a)
    {
        if(a&1) ret*=x;
        x=x*x; a>>=1; 
    }
    return ret;
}
mint inv(mint x) { return mpow(x, MOD-2); }

mint ppow[MAXM+10], ppow2[MAXM+10];

struct Hash
{
    bitset<MAXM> V;
    vector<int> V2;
    mint val;
    int msb, lsb;
    Hash() { init(); }
    void push(int x)
    {
        for(; V[x]; x++)
        {
            V[x]=0;
            if(x==lsb) lsb++;
            val-=ppow[x];
        }
        V[x]=1;
        val+=ppow[x];
        msb=max(msb, x);
        lsb=min(lsb, x);
        V2.push_back(x);
    }
    void init()
    {
        for(auto it : V2) V[it]=0;
        V2.clear(); val=0;
        msb=-1; lsb=MAXM+1;
    }
} H1, H2;

vector<int> adj[MAXN+10];

void solve(int l, int r)
{
    if(l==r)
    {
        adj[r].push_back(r-1);
        return;
    }
    int mid=l+r>>1;
    solve(l, mid);
    solve(mid+1, r);

    {
        H1.init(); H2.init();
        vector<pii> V;
        for(int i=mid; i>=l; i--)
        {
            H2.push(A[i]);
            V.push_back({H2.val, i});
        }
        sort(V.begin(), V.end());
        V.erase(unique(V.begin(), V.end()), V.end());

        for(int i=mid+1; i<=r; i++)
        {
            H1.push(A[i]);
            int t=(int)(ppow2[H1.msb]-(H1.lsb>0 ? ppow2[H1.lsb-1] : mint(0))+ppow[H1.lsb]-H1.val);
            for(auto it=lower_bound(V.begin(), V.end(), pii(t, 0)); it->first==t; it++) adj[i].push_back(it->second-1);
        }
    }
    {
        H1.init(); H2.init();
        vector<pii> V;
        for(int i=mid+1; i<=r; i++)
        {
            H2.push(A[i]);
            V.push_back({H2.val, i});
        }
        sort(V.begin(), V.end());
        V.erase(unique(V.begin(), V.end()), V.end());

        for(int i=mid; i>=l; i--)
        {
            H1.push(A[i]);
            int t=(int)(ppow2[H1.msb]-(H1.lsb>0 ? ppow2[H1.lsb-1] : mint(0))+ppow[H1.lsb]-H1.val);
            for(auto it=lower_bound(V.begin(), V.end(), pii(t, 0)); it->first==t; it++) adj[it->second].push_back(i-1);
        }
    }
}

int dp[MAXN+10];

int main()
{
    scanf("%d", &N);
    for(int i=1; i<=N; i++) scanf("%d", &A[i]);

    ppow[0]=1;
    for(int i=1; i<=MAXM; i++) ppow[i]=ppow[i-1]*2;
    ppow2[0]=1;
    for(int i=1; i<=MAXM; i++) ppow2[i]=ppow2[i-1]+ppow[i];

    solve(1, N);

    dp[0]=1;
    for(int i=1; i<=N; i++)
    {
        sort(adj[i].begin(), adj[i].end());
        adj[i].erase(unique(adj[i].begin(), adj[i].end()), adj[i].end());
        for(auto j : adj[i]) dp[i]=(dp[i]+dp[j])%MOD;
    }
    printf("%d\n", dp[N]);
}