#include <bits/stdc++.h>

using namespace std;

int npr[1201][1201];
int ncr[1201][1201];
int p=1000000007;

/*
int find(vector<int> a,int x,int l,int r,int ans,int pr,int tr)
{
    if(l==r)
        return ans;
    if(x==1)
        return (ans+tr)%p;
    if(pr==-1)
    {
        while(a[l]>=x)
        {
            ans=ans+ncr[a[l]][x]
        }
    }
}*/


int main(){
    int n;
    cin >> n;
    int i,j;
    for(i=0;i<=1200;i++)
    {
        npr[i][0]=1;
        ncr[0][i]=1;
        ncr[i][0]=1;
    }
    npr[1][0]=1;
    npr[1][1]=1;
    ncr[1][0]=1;
    ncr[1][1]=1;
    for(i=2;i<=1200;i++)
    {
        for(j=1;j<=i;j++)
        {
            npr[i][j]=(npr[i-1][j]+j*npr[i-1][j-1])%p;
            ncr[i][j]=(ncr[i-1][j-1]+ncr[i-1][j])%p;
        }
    }
    cout<<"1";
   /*for(i=2;i<10;i++)
        for(j=0;j<=i;j++)
        cout<<i<<"C"<<j<<" "<<ncr[i][j]<<endl;*/
    vector<int> m(n);
    for(i=0;i<n;i++)
        cin>>m[i];
 /*   for(i=0;i<n-1;i++)
        if(a[i]>a[i+1])
        break;
    int x=i+1;
    vector<int> a;
    int l=1;
    for(i=0;i<n-1;i++)
    {
        if(m[i]<m[i+1])
            l++;
        else
        {
            a.push_back(l);
            l=1;
        }
    }
    a.push_back(l);
    n=a.size();
    /*for(i=0;i<n;i++)
        cout<<a[i]<<" ";
    int ans=0;
    for(i=1;i<=x;i++)
    {
        ans=(ans+find(a,x,0,n,0,))%p;
    }*/
    // your code goes here
    return 0;
}