#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.1415926535897932;
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 f(int a, int b){
    return (a+b)%MOD;
}

struct BIT{
    private:
        
        int n;
        vector<int> node;

    public:

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

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

        BIT() {}

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

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

void Main(){
    int N; cin >> N;
    VI A(N); REP(i,N) cin >> A[i];

    VVI lis(N);
    VI dp(N,INF), v(N);
    REP(i,N){
        int t = LB(dp, A[i]);
        dp[t] = A[i];
        lis[t].push_back(A[i]);
        v[i] = t;
    }

    map<int,int> m[N], minv[N];
    REP(i,N){
        SORT(lis[i]);
        lis[i].erase(unique(lis[i].begin(), lis[i].end()), lis[i].end());
        REP(j,lis[i].size()){
            m[i][lis[i][j]] = j;
            minv[i][j] = lis[i][j];
        }
    }

    int sz = LB(dp, INF);
    vector<BIT> bit(sz); REP(i,sz) bit[i] = BIT(lis[i].size());
    REP(i,N){
        int t = v[i];
        if(t > 0){
            int l = 0, r = lis[t-1].size();
            while(r-l>1){
                int x = (l+r)/2;
                if(minv[t-1][x] < A[i]) l = x;
                else r = x;
            }
            int sum = bit[t-1].sum(r);
            bit[t].add(m[t][A[i]]+1, sum);
        }
        else{
            bit[t].add(m[t][A[i]]+1, 1);
        }
    }

    int ans = bit[sz-1].sum(lis[sz-1].size());
    cout << ans << en;
    return;
}

int main(void){
    cin.tie(0);ios_base::sync_with_stdio(0);cout<<fixed<<setprecision(15);
    int t=1; //cin>>t;
    REP(_,t){
        Main();
    }
    return 0;
}