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

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef tuple<int,int,int> tpl;

#define ALL(a)  (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define REVERSE(c) reverse((c).begin(),(c).end())
#define LB(a,x) lower_bound((a).begin(), (a).end(), x) - (a).begin()
#define UB(a,x) upper_bound((a).begin(), (a).end(), x) - (a).begin()

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define RFOR(i,a,b) for(int i=(a)-1;i>=(b);--i)
#define RREP(i,n) RFOR(i,n,0)

#define en "\n"

constexpr double EPS = 1e-9;
constexpr double PI  = 3.141592653589793238462643383279;
constexpr int INF = 2147483647;
constexpr long long LINF = 1LL<<60;
constexpr long long MOD = 1000000007; // 998244353

#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

int func(int a, int b){return (a+b)%MOD;}
int init_v = 0;

template<typename T>
struct BIT{

    int n;
    vector<T> node;

    public:

        BIT(int N) {
            n = N + 1;

            node.resize(n, init_v);
            for(int i=1; i<n; i++) if((i+(i&-i)) < n) node[i+(i&-i)] = func(node[i+(i&-i)], node[i]);
        }

        BIT() {}

        void add(int pos, T v) {
            // 1-indexed
            if(pos == 0) return;
            while(pos < n){
                node[pos] = func(node[pos], v);
                pos += pos & -pos;
            }
        }

        T sum(int pos){
            // 1-indexed
            T res = init_v;
            while(pos > 0){
                res = func(res, node[pos]);
                pos = pos & (pos-1);
            }
            return res;
        }
};

void compress(vector<int> &v){
    int N = v.size(), mn = 1000000000;
    vector<pair<int,int>> a(N);
    for(int i=0; i<N; ++i){
        a[i].first = v[i];
        a[i].second = i;
        mn = min(mn, v[i]);
    }
    sort(a.begin(), a.end());
    
    int prev = mn-1, n = -1;
    for(int i=0; i<N; ++i){
        if(a[i].first == prev) v[a[i].second] = n;
        else{
            n++;
            prev = a[i].first;
            v[a[i].second] = n;
        }
    }
}

int main(void){
    int N; cin >> N;
    VI A(N); REP(i,N) cin >> A[i];
    compress(A);
    VI dp, len(N), mx(N+1,0);
    int maxlen = 0;
    REP(i,N){
        int t = LB(dp, A[i]);
        if(t < dp.size()) chmin(dp[t], A[i]);
        else dp.push_back(A[i]);
        len[i] = t+1;
        chmax(mx[len[i]], A[i]+1);
        chmax(maxlen, len[i]);
    }

    vector<BIT<int>> v(N+1);
    REP(i,N+1) v[i] = BIT<int>(mx[i]);

    REP(i,N){
        int idx = min(v[len[i]-1].n-1, A[i]);
        int n = len[i]>1 ? v[len[i]-1].sum(idx) : 1;
        v[len[i]].add(A[i]+1, n);
    }

    int ans = v[maxlen].sum(mx[maxlen]);
    cout << ans << en;
    return 0;
}