#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const ll MOD = 1000000007;

ll modpow(ll x, ll n, ll mod = MOD) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}

const ll INF = 1e15;

//引数unzipには圧縮前のvectorを入れる
int compress(vector<ll>& unzip, map<ll, int>& zip) {
    sort(unzip.begin(), unzip.end());
    unzip.erase(unique(unzip.begin(), unzip.end()), unzip.end());
    for (int i = 0; i < unzip.size(); i++) {
        zip[unzip[i]] = i;
    }
    return unzip.size();
}

template <class Monoid>
struct SegmentTree {
    using T = typename Monoid::T;

    int n;
    vector<T> data;

    SegmentTree() {}

    SegmentTree(int size, T initial_value = Monoid::unit()) {
        n = 1;
        while (n < size) n <<= 1;
        data.assign(2 * n - 1, initial_value);

        if (initial_value != Monoid::unit()) {
            for (int i = n - 2; i >= 0; i--) data[i] = Monoid::merge(data[i * 2 + 1], data[i * 2 + 2]);
        }
    }

    SegmentTree(const vector<T>& v) {
        int size = v.size();
        n = 1;
        while (n < size) n <<= 1;
        data.assign(2 * n - 1, Monoid::unit());

        for (int i = 0; i < size; i++) data[i + n - 1] = v[i];
        for (int i = n - 2; i >= 0; i--) data[i] = Monoid::merge(data[i * 2 + 1], data[i * 2 + 2]);
    }

    T getLeaf(int k) {
        return data[k + n - 1];
    }

    void update(int k, T x) {
        k += n - 1; //葉の節点
        Monoid::update(data[k], x);
        while (k > 0) {
            k = (k - 1) / 2;
            data[k] = Monoid::merge(data[k * 2 + 1], data[k * 2 + 2]);
        }
    }

    //区間[a, b)に対するクエリに答える
    //k:節点番号, [l, r):節点に対応する区間
    T query(int a, int b, int k, int l, int r) {
        //[a, b)と[l, r)が交差しない場合
        if (r <= a || b <= l) return Monoid::unit();
        //[a, b)が[l, r)を含む場合、節点の値
        if (a <= l && r <= b) return data[k];
        else {
            //二つの子をマージ
            T vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
            T vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
            return Monoid::merge(vl, vr);
        }
    }

    //外から呼ぶ用
    T query(int a, int b) {
        return query(a, b, 0, 0, n);
    }

    //非再帰版: バグってるかもしれないので定数倍高速化する時以外使わないで
    //区間[a, b)に対するクエリに答える
    T query_fast(int a, int b) {
        T vl = Monoid::unit(), vr = Monoid::unit();
        for (int l = a + n, r = b + n; l != r; l >>= 1, r >>= 1) {
            if (l & 1) vl = Monoid::merge(vl, data[l++ - 1]);
            if (r & 1) vr = Monoid::merge(data[--r - 1], vr);
        }
        return Monoid::merge(vl, vr);
    }
};

// 以下、Monoidの例
template <class U = ll>
struct RangeMin {
    using T = U;
    static T merge(T x, T y) { return min(x, y); }
    static void update(T& target, T x) { target = x; }
    static constexpr T unit() { return numeric_limits<T>::max(); }
};

template <class U = ll>
struct RangeSum {
    using T = U;
    static T merge(T x, T y) { return (x + y) % MOD; }
    static void update(T& target, T x) { (target += x) %= MOD; }
    static constexpr T unit() { return T(0); }
};

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<ll> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }

    vector<ll> zip = a;
    map<ll, int> unzip;
    int sz = compress(zip, unzip);

    vector<ll> dp(n + 1, INF);
    vector<int> num(n);
    for (int i = 0; i < n; ++i) {
        int idx = lower_bound(dp.begin(), dp.end(), a[i]) - dp.begin();
        num[i] = idx;
        dp[idx] = a[i];
    }
    int max_len = lower_bound(dp.begin(), dp.end(), INF) - dp.begin();
    // cerr << max_len << endl;

    vector< vector<int> > ids(max_len);
    for (int i = 0; i < n; ++i) {
        ids[num[i]].push_back(i);
    }

    vector<ll> dp2(n, 0);
    for (int i : ids[0]) {
        dp2[i] = 1;
    }

    for (int i = 0; i < max_len - 1; ++i) {
        vector<int>& cur = ids[i];
        vector<int>& nex = ids[i + 1];

        vector<ll> v;
        for (int j : cur) v.push_back(a[j]);
        for (int j : nex) v.push_back(a[j]);
        map<ll, int> unzip;
        int sz = compress(v, unzip);

        SegmentTree< RangeSum<> > tmp(sz);
        for (int ii = 0, jj = 0; ;) {
            if (jj == nex.size()) break;
            if (ii == cur.size()) {
                dp2[nex[jj]] = tmp.query_fast(0, unzip[a[nex[jj]]]);
                ++jj;
            } else {
                if (cur[ii] < nex[jj]) {
                    int idx = unzip[a[cur[ii]]];
                    tmp.update(idx, dp2[cur[ii]]);
                    ++ii;
                } else {
                    dp2[nex[jj]] = tmp.query_fast(0, unzip[a[nex[jj]]]);
                    ++jj;
                }
            }
        }
    }

    ll ans = 0;
    for (int i = 0; i < n; ++i) {
        //cerr << dp2[i] << endl;
        if (num[i] + 1 == max_len) (ans += dp2[i]) %= MOD;
    }
    cout << ans << "\n";
    return 0;
}