//    JAI JINENDRA
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define MAX 1205
#define MOD 1000000007
long long int power(long long int A,long long int N)
{
   if(N==0)
      return 1;
   long long int res=power(A,N/2);
   res=res*res%MOD;
   if(N%2)
      return res*A%MOD;
   return res;
}
long long int N,i,fact[MAX],arr[MAX][MAX],n,inverseFact[MAX],k,j,data[MAX],ans,last[MAX];
int main()
{
   cin>>N;
   for(i=1;i<=N;++i)
      cin>>data[i];

   for(i=N;i>0;)
   {
      last[i]=i;
      for(j=i-1;j>0&&data[j]<data[j+1];--j)
         last[j]=i;
      i=j;
   }
/*
   for(i=1;i<=N;++i)
      cout<<last[i]<<" ";
   cout<<endl<<endl;
*/
   fact[0]=inverseFact[0]=1;
   for(i=1;i<MAX;++i)
   {
      fact[i]=fact[i-1]*i%MOD;
      inverseFact[i]=power(fact[i],MOD-2);
   }

   for(n=N;n;--n)
   {
      for(k=1;k<=last[n]-n+1;++k)
      {
         if(N-n+1==k)
            arr[n][k]=1;
         else
         {
            arr[n][k]=0;
            for(j=1;j<=k;++j)
               arr[n][k]=(arr[n][k]+arr[n+k][j]*fact[k]%MOD*inverseFact[k-j]%MOD)%MOD;
         }
      }
      for(;k<=N;++k)
         arr[n][k]=0;
   }

   /*
   for(n=1;n<=N;++n,cout<<endl)
   for(k=1;k<=N;++k)
   cout<<arr[n][k]<<" ";
   */
   ans=0;
   for(i=1;i<=N;++i)
      ans=(ans+arr[1][i])%MOD;
   cout<<ans<<endl;
   return 0;
}