NTSEQ

//Nguyen Huu Hoang Minh
#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define reset(x) memset(x, 0,sizeof(x))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define N 100050
#define remain(x) if (x > MOD) x -= MOD
#define ii pair<int, int>
#define iiii pair< ii , ii >
#define viiii vector< iiii >
#define vi vector<int>
#define vii vector< ii >
#define bit(x, i) (((x) >> (i)) & 1)
#define Task "test"
#define int long long

using namespace std;

typedef long double ld;
const int inf = 1e10;
const int minf = -1e10;
const int mod = 1000000007;

int n, a[N];
ii bit[N];

void readfile()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if (fopen(Task".inp","r"))
    {
        freopen(Task".inp","r",stdin);
        //freopen(Task".out","w",stdout);
    }
    cin >> n;
    for(int i=1; i<=n; i++) cin >> a[i];
}

void compress()
{
    set<int> s(a+1,a+1+n);
    vector<int> b(s.begin(),s.end());
    for(int i=1; i<=n; i++)
    {
        int x = a[i];
        int k = lower_bound(b.begin(),b.end(),x)-b.begin()+1;
        a[i] = k;
    }
}

ii get(int x)
{
    ii ans = ii(0,0);
    for(; x > 0; x -= x & -x)
    {
        if (bit[x].fi > ans.fi)
        {
            ans = bit[x];
        }
        else if (bit[x].fi == ans.fi)
        {
            ans.se = (ans.se + bit[x].se)%mod;
        }
    }
    if (ans.fi==0) return ii(1,1);
    else ans.fi++;
    return ans;
}

void up(int x, ii val)
{
    for(; x <= N; x += x & -x)
    {
        if (val.fi > bit[x].fi)
        {
            bit[x] = val;
        }
        else if (bit[x].fi == val.fi){
            bit[x].se = (bit[x].se + val.se)%mod;
        }
    }
}

void proc()
{
    compress();
    for(int i=1; i<=n; i++)
    {
        ii p = get(a[i]-1);
        up(a[i],p);
    }
    cout << get(N-1).se;
}

signed main()
{
    readfile();
    proc();
    return 0;
}