//#pragma comment(linker,"/STACK:102400000,102400000")
#include<stdio.h>
#include<iostream>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<string>
#include<time.h>
#include<stdlib.h>
#include<ctype.h>
#include<list>
//#include<ext/rope>
#define PB push_back
#define MP make_pair
#define PF push_front
#define lson k<<1
#define rson k<<1|1
using namespace std;
typedef long long ll;
typedef double db;
typedef long double ldb;

const int N = 1205;
const ll MOD = 1000000007;
ll f[N][N];
int a[N];

void Update(ll &now,ll val)
{
    now += val;
    if(now>=MOD) now-=MOD;
}

int main()
{
#ifdef PKWV
//    freopen("in.in","r",stdin);
#endif // PKWV
    int n;
    while(scanf("%d",&n)+1)
    {
        for(int i=0; i<n; i++) scanf("%d",&a[i]);
        for(int i=0; i<=n; i++) for(int j=0; j<=n; j++) f[i][j]=0;
        f[n][0]=1;
        for(int i=n-1; i>=0; i--)
        {
            for(int j=1; j<=n&&i+j<=n; j++)
            {
                bool ok(true);
                for(int k=1; k<j; k++) if(a[i+k-1]>a[i+k]) ok=false;
                if(ok)
                {
                    ll ajk = 1;
                    for(int k=0; k<=j; k++)
                    {
                        Update(f[i][j],f[i+j][k]*ajk%MOD);
                        ajk = ajk*(j-k)%MOD;
                    }
                }
            }
        }
        ll res(0);
        for(int i=1; i<=n; i++) res+=f[0][i];
        printf("%lld\n",res%MOD);
    }
    return 0;
}