#include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=int(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
#define rAll(x) (x).rbegin(),(x).rend()
using namespace std;
using ll = long long;

int main(){
    constexpr ll mod=1e9+7;
    int N;cin>>N;
    vector<int> a(N+1,-1e9-1);
    REP(i, N) cin >> a[i+1];
    vector<pair<ll,int>> dp(N+1);
    dp[0]=make_pair(1,1);
    REP(i,N) REP(j,i+1){
        if(a[j]<a[i+1]){
            if(dp[j].second+1>dp[i+1].second){
                dp[i+1]=dp[j];
                dp[i+1].second++;
            }
            else if(dp[j].second+1==dp[i+1].second){
                dp[i+1].first+=dp[j].first;
                dp[i+1].first%=mod;
            }
        }
    }
    pair<ll,int> ans=make_pair(0,0);
    REP(i,N+1){
        if(dp[i].second>ans.second){
            ans=dp[i];
        }
        else if(dp[i].second==ans.second){
            ans.first+=dp[i].first;
        }
    }
    cout<<ans.first<<endl;
}