#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <memory.h>
#include <cassert>
#include <climits>
#include <queue>
#define MOD 1000000007

using namespace std;

typedef long long ll;

int main() 
{
   ll n;
   cin>>n;
   
   ll arr[n];
   
   for (ll i=0;i<n;i++) cin>>arr[i];
   
   ll i=0;
   
   while (i+1<n && arr[i+1]>arr[i])  i++;
   
   ll k=i+1;
    
    if (k==1)
        {
        cout<<1<<endl;
        return 0;
    }
   ll cnt=0;
   
   ll fact[10000];
   fact[0]=fact[1]=1;
   
   for (ll i=2;i<10000;i++) fact[i]=(fact[i-1]*i)%MOD;
   
   for (i=1;i<=k;i++)
   {
       ll rem=k-i;
       
       for (ll j=0;j<rem;j++) cnt=(cnt+fact[i])%MOD;
       
       rem=n-k;
       
       if (rem!=0)  cnt=(cnt*i)%MOD;
   }
   
   cout<<cnt<<endl;
}