/* Problem URL: https://cses.fi/problemset/task/1748 */

#include <bits/stdc++.h>

using namespace std;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;

    map<int, int> var;
    vi fds(n);
    repv(i, fds) {
        cin >> i;
        var[i] = 0;
    }

    int v = 0;
    repv(i, var) {
        i.second = v;
        v++;
    }

    repv(i, fds) {
        i = var[i];
    }

    while (__builtin_popcount(fds.size()) != 1) {
        fds.push_back(0);
    }

    vl seg(fds.size() * 2);
    ll mod = 1e9 + 7;
    
    auto update = [&](int i, ll v) {
        seg[i + fds.size()] += v;
        seg[i + fds.size()] %= mod;
        for (i = (i + fds.size()) / 2; i > 0; i /= 2) {
            seg[i] = (seg[i * 2] + seg[i * 2 + 1]) % mod;
        }
    };

    function<ll(int, int, int, int, int)> search = [&](int i, int l, int r, int tl, int tr) -> ll {
        if (l > tr || r < tl) {
            return 0;
        }

        if (l >= tl && r <= tr) {
            return seg[i];
        }

        int mid = (l + r) / 2;
        return (search(i * 2, l, mid, tl, tr) + search(i * 2 + 1, mid + 1, r, tl, tr)) % mod;
    };

    rep(i, n) {
        ll tmp = search(1, 0, fds.size() - 1, 0, fds[i] - 1) + 1;
        update(fds[i], tmp);
    }

    cout << search(1, 0, n - 1, 0, n - 1) << '\n';
}