#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
 
const double pi = 3.141592653589793238462643383279;
using namespace std;
using namespace __gnu_pbds;
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
 
 
//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
 
 
//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007
 
 
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
 
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
 
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
 
const long double EPS = 1e-6, PI = acos((long double)-1);
 
// ここから編集
struct Node{
  int length;
  ll pat;
};

Node Max(Node a, Node b){
  if(a.length == b.length){
    a.pat = (a.pat + b.pat) % MOD;
    return a;
  }else{
    if(a.length > b.length) return a;
    return b;
  }
}
struct BIT{
  vector<Node> node;

  int N;
  BIT(int n){
    N = n;
    node.resize(N+1);
  }

  void add(int i, Node x){
    i++;
    while(i <= N){
      node[i] = Max(node[i], x);
      i += (i & -i);
    }
  }

  Node query(int i){
    Node res = {0, 0};
    while(i > 0){
      res = Max(res, node[i]);
      i -= (i & -i);
    }
    return res;
  }
};

ll dp[201010];
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  
  int N; cin >> N;
  vector<ll> a(N);
  REP(i,N) cin >> a[i];
  vector<pair<ll, ll>> vp;
  REP(i,N){
    vp.push_back({a[i], -(i+1)});
  }
  sort(all(vp));
  BIT bit(N+10);
  bit.add(1, {0, 1});
  for(int i=0; i<N; i++){
    int pos = -vp[i].second;

    Node pre = bit.query(pos+1);
    pre.length++;
    
    bit.add(pos, pre);
  }
  cout << bit.query(N+1).pat << endl;
  return 0;
}