//  Mohib Manva.
#include<bits/stdc++.h>
using namespace std;
#define ll long long 
#define mod 1000000007
static ll nCr[1505][1505],a[1500];
static ll f1[1505];

int main(){
    f1[0] = 1ll;
    for(int i=1;i<=1500;i++){
        f1[i] = (f1[i-1]*i*1ll)%mod;
    }
    nCr[0][0] = 1ll;
    for(int i=1;i<=1500;i++){
        for(int j=0;j<=i;j++){
            nCr[i][j] = nCr[i-1][j];
            if(j>0){
                nCr[i][j] += nCr[i-1][j-1];
                nCr[i][j] %= mod;
            }
        }
    }
    
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%lld",&a[i]);
    }
    static long long dp[1505][1505];    //  dp[last index][count of the subarray in last step].
    dp[1][1] = 1ll;
    for(int i=2;i<=n;i++){
        if(a[i-1]<a[i]){
            dp[i][i] = 1ll;
        } else 
            break;
    }
    
    static bool dp1[1505][1505];
    for(int i=1;i<=n;i++){
        dp1[i][i] = 1;
    }
    for(int len=2;len<=n;len++){
        for(int i=1;i<=n-len+1;i++){
            int l = i + len - 1;
            if(a[l-1]<a[l]){
                dp1[i][l] = dp1[i][l-1];
            } else
                dp1[i][l] = 0;
        }
    }
    long long ans = 0;
    
    for(int i=2;i<=n;i++){
        for(int j=i;j<=n;j++){
            if(dp1[i][j]==0){
                continue;
            }
            int count = j - i + 1;
            ll sum = 0ll;
            for(int k=count;k<=(i-1);k++){
                sum += (((dp[i-1][k] * nCr[k][count])%mod)*f1[count])%mod;
                if(sum>=mod)
                    sum -= mod;
            }
            dp[j][count] += sum;
            if(dp[j][count]>=mod){
                dp[j][count] -= mod;
            }
            if(j==n){
                ans += dp[j][count];
                if(ans>=mod){
                    ans -= mod;
                }
            }
        }
    }
    printf("%lld\n",ans+dp[n][n]);
    return 0;
}