#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;
const int N=3e5+5,M=1e6+5,L=21,P=1e9+7;
int n,a[N],dp[N],mx[L][N];map<pii,int> mp;
ll P1=1000000000000002493,P2=1000000000000002481,val1[M],val2[M],hsh1[N],hsh2[N];
inline int chkmax(int i,int j){return (a[i]>a[j]||a[i]==a[j]&&i<j)?i:j;}
int query(int l,int r){
    int x=log2(r-l+1);
    return chkmax(mx[x][l],mx[x][r-(1<<x)+1]);
}
void solve(int l,int r){
    if(l>r)return;
    int m=query(l,r);solve(l,m-1);dp[m]=(dp[m]+dp[m-1])%P;
    if(m-l>r-m){
        for(int i=a[m]+1;i<=a[m]+L&&i<M;i++)
            for(int j=m;j<=r;j++){
                pii tmp={(hsh1[j]-val1[i]+P1)%P1,(hsh2[j]-val2[i]+P2)%P2};
                if(mp.find(tmp)==mp.end())continue;
                int k=mp[tmp];if(k<l-1||k>=m)continue;dp[j]=(dp[j]+dp[k])%P;
            }
    }
    else{
        for(int i=a[m]+1;i<=a[m]+L&&i<M;i++)
            for(int j=l-1;j<m;j++){
                pii tmp={(hsh1[j]+val1[i])%P1,(hsh2[j]+val2[i])%P2};
                if(mp.find(tmp)==mp.end())continue;
                int k=mp[tmp];if(k<m||k>r)continue;dp[k]=(dp[k]+dp[j])%P;
            }
    }
    solve(m+1,r);
}
int main(){
    ios::sync_with_stdio(false);cin.tie(0);
    cin>>n;for(int i=1;i<=n;i++)cin>>a[i],mx[0][i]=i;val1[0]=val2[0]=1;
    for(int i=1;i<M;i++)val1[i]=2*val1[i-1]%P1,val2[i]=2*val2[i-1]%P2;
    mp[{0,0}]=0;
    for(int i=1;i<=n;i++){
        hsh1[i]=(hsh1[i-1]+val1[a[i]])%P1;
        hsh2[i]=(hsh2[i-1]+val2[a[i]])%P2;
        mp[{hsh1[i],hsh2[i]}]=i;
    }
    for(int j=1;(1<<j)<=n;j++)
        for(int i=1;i<=n-(1<<j)+1;i++)
            mx[j][i]=chkmax(mx[j-1][i],mx[j-1][i+(1<<j-1)]);
    dp[0]=1;solve(1,n);cout<<dp[n]<<"\n";
    return 0;
}