#include <bits/stdc++.h>
#define FOR(a,b,c) for(int a=b; a<c; a++)
#define mp make_pair
#define pb push_back
#define maxn (int)(1202)
#define mod (int)(1e9+7)
using namespace std;
long int n,inp[maxn],dp[maxn][maxn],dp2[maxn][maxn],seq[maxn];


int findseq(int index)
{
    int r=1;
    FOR(i,index+1,n)
    {
        if(inp[i]<=inp[i-1])
        {
            return r;
        }
        r++;
    }
    return r;
}
long int perm(long int a, long int b)
{
    if(dp2[a][b])
        return dp2[a][b];
    long int r=1;
    for(long int i = a; a-i < b;i--)
        r= (r*i)%mod;
    return dp2[a][b]=r;
}
long int fun(long int a, long int s)
{
    if(dp[a][s])
        return dp[a][s];
    long int o=0;
    long int ss= min(s,seq[a]);
    if(a>=n||s==1)
        return 1;
    FOR(i,1,ss+1)
    {
        long int oo= fun(a+i,i) * perm(s,i);
        o = (o+oo%mod)%mod;
    }
    return dp[a][s]=o;
}
void init()
{
    FOR(i,0,n)
        seq[i]=findseq(i);
}

int main() {
    cin >>n;

    FOR(i,0,n)
    {
        cin >> inp[i];
    }
    init();
    long o = 0;
    FOR(i,1,seq[0]+1)
    {
        o = (o+fun(i,i))%mod;
    }
    cout <<o;
    return 0;
}