#include <bits/stdc++.h>

using namespace std;
typedef long long int ll;

const ll modulo = 1000*1000*1000+7;

vector<int> m;
vector<vector<ll>> emplacements;
vector<vector<ll>> dyn;

int n;

int find_inc_seq_border(int i_from) 
{
    int i = i_from + 1;
    while (i < n) {
        if (m[i] > m[i-1]) 
            ++i;
        else
            break;
    }
    return i;
}

ll rec(int i_cur, int max_size, int i_border)
{
    if (i_cur == n)
        return 1ll;
    if (dyn[i_cur][max_size] == -1) {
        if (i_cur == i_border)
            i_border = find_inc_seq_border(i_border);
        ll ans = 0;
        for(int i=i_cur; i<min(i_cur + max_size, i_border); ++i) {
            int size = i - i_cur + 1;
            ans = (ans + emplacements[max_size][size] * rec(i+1, size, i_border)) % modulo;
        }
        dyn[i_cur][max_size] = ans;
    }
    return dyn[i_cur][max_size];    
}


int main()
{
    cin >> n;
    m.resize(n);
    emplacements.resize(n);
    dyn.resize(n);
    for(int i=0; i<n; i++)
       cin >> m[i];
    for(int i=0; i<emplacements.size(); ++i) {
        dyn[i].resize(n, -1);
        emplacements[i].resize(emplacements.size());
        emplacements[i][0] = 1;
        for(int j=1; j<=i; ++j)
            emplacements[i][j] = (emplacements[i][j-1]*(i-j+1)) % modulo;
    }
    /*fact[0] = 1;
    for(int i=1; i<fact.size(); ++i)
        fact[i] = (fact[i-1] * i) % modulo;*/
    ll ans = 0;
    int cur_pos = 0;
    int i_border = find_inc_seq_border(0);
    for(int i=0; i<i_border; ++i) {
        ans = (ans + rec(i+1, i+1, i_border)) % modulo;
        //cout << i+1 << ": " << rec(i+1, i+1, i_border) << endl;
    }
    cout << ans << endl;
    // your code goes here
    return 0;
}