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

struct IoSetup {
	IoSetup() {
		cin.tie(nullptr);
		ios::sync_with_stdio(false);
		cout << fixed << setprecision(10);
		cerr << fixed << setprecision(10);
	}
} iosetup;

template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
	os << p.first << " " << p.second;
	return os;
}

template <typename T1, typename T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
	is >> p.first >> p.second;
	return is;
}

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
	for (int i = 0; i < (int)v.size(); i++) {
		os << v[i] << (i + 1 != v.size() ? " " : "");
	}
	return os;
}

template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
	for (T& in : v) is >> in;
	return is;
}

template <typename T1, typename T2>
inline bool chmax(T1& a, T2 b) {
	return a < b && (a = b, true);
}

template <typename T1, typename T2>
inline bool chmin(T1& a, T2 b) {
	return a > b && (a = b, true);
}

template <typename T = long long>
vector<T> make_v(size_t a) {
	return vector<T>(a);
}

template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
	return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T& t, const V& v) {
	t = v;
}

template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T& t, const V& v) {
	for (auto& e : t) fill_v(e, v);
}
#define rep(i,n) for (int i = 0; i< (n); ++i)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define all(x) (x).begin(), (x).end()
#define fore(i, a) for(auto &i:a)
#define DEBUG(x) cerr << #x << ": "; for (auto _ : x) cerr << _ << " "; cerr << endl;
using ll = long long;
const ll infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
bool bit(ll x, int k){return((x >> k)&1);}
#include<atcoder/modint>
using namespace atcoder;
using mint = modint1000000007;

struct LIS{
	vector<ll> dp;
	vector<ll> idx_;
	vector<ll> idx;
	vector<vector<ll>> cand;
	ll L;
	LIS(vector<ll> A){
		ll sz = A.size();
		dp = vector<ll>(sz, infll);
		cand = vector<vector<ll>>(sz);
		idx = vector<ll>(sz, -1);
		idx_ = vector<ll>(sz);
		L = -1;
		rep(i, sz){
			ll pos = LB(dp, A[i]);
			dp[pos] = A[i];
			idx_[i] = pos;
			chmax(L, pos);
		}
		L++;
		vector<ll> i_nxt(sz,infll);
		rep(ii, sz){
			ll i = sz-1-ii;
			if(idx_[i] == L-1 || (i_nxt[idx_[i]+1] != infll && A[i] < A[i_nxt[idx_[i]+1]])){
				idx[i] = idx_[i];
				chmin(i_nxt[idx[i]], i);
				cand[idx[i]].push_back(i);
			}
		}
		rep(i, sz){
			So(cand[i]);
		}
	}
};
template <class T>
struct CumulativeSum {
	vector<T> data;

	CumulativeSum() = default;

	explicit CumulativeSum(size_t sz) : data(sz + 1, 0) {}

	void add(int k, const T& x) { data[k + 1] += x; }

	void build() {
		for (int i = 1; i < data.size(); i++) {
			data[i] += data[i - 1];
		}
	}

	T fold(int r) const {
		if (r < 0) return 0;
		return data[min(r, (int)data.size() - 1)];
	}

	T fold(int l, int r) const { return fold(r) - fold(l); }
};
template <typename T, typename F> T bisect(T ok, T bad, F pred) {
	if (!pred(ok)) {
		return ok;
	}

	while (bad - ok > 1) {
		T mid = ok + (bad - ok) / 2;
		(pred(mid) ? ok : bad) = mid;
	}
	return bad;
}
void solve();

int main(){
	int t=1;
	//cin >> t;
	repi(i, 0, t) solve();
}

void solve(){
	ll n;
	cin >> n;
	vector<ll> a(n);
	cin >> a;
	LIS lis(a);
	ll L = lis.L;
	vector<mint> dp(n, 0);
	for(auto i:lis.cand[L-1]){
		dp[i] = 1;
	}
	for(ll i = L-2;i >= 0;i--){
		CumulativeSum<mint> c(lis.cand[i+1].size());
		rep(j, lis.cand[i+1].size()){
			c.add(j, dp[lis.cand[i+1][j]]);
		}
		c.build();
		for(auto v:lis.cand[i]){
			auto pr = [&](ll x){
				return a[v] < a[lis.cand[i+1][x]];
			};
			auto pr2 = [&](ll x){
				return v > lis.cand[i+1][x];
			};
			ll posl = bisect(0LL, (ll)lis.cand[i+1].size(), pr2);
			ll pos = bisect(0LL, (ll)lis.cand[i+1].size(), pr);
			dp[v] = c.fold(posl, pos);
		}
	}
	mint ans = 0;
	for(auto v:lis.cand[0])ans += dp[v];
	cout << ans.val() << "\n";
}