#include <bits/stdc++.h>
#define MODU 1000000007
#define ll long long

using namespace std;

ll getFact(int n)
{
	ll sum=1;
	for(int i=2;i<=n;i++)
		sum=(sum*i)%MODU;
	return sum;
}

int check(int arr[],int start,int end)
{
	for(int i=start+1;i<=end;i++)
	{
		if(arr[i]<arr[i-1])
			return 0;
	}
	return 1;
}

int nCrModpDP(int n, int r, int p)
{
    int C[r+1];
    memset(C, 0, sizeof(C));

    C[0] = 1;

    for (int i = 1; i <= n; i++)
    {
        for (int j = min(i, r); j > 0; j--)

            C[j] = (C[j] + C[j-1])%p;
    }
    return C[r];
}

int nCrModpLucas(int n, int r, int p)
{
   if (r==0)
      return 1;

   int ni = n%p, ri = r%p;

   return (nCrModpLucas(n/p, r/p, p) * nCrModpDP(ni, ri, p)) % p;
}



ll ncr(int n,int r)
{
	ll sum=nCrModpLucas(n,r,MODU);
	return sum;
}

int main()
{
	int n;
	scanf("%d",&n);
	int arr[n];
	for(int i=0;i<n;i++)
		scanf("%d",&arr[i]);
	ll sum=0;
	for(int j=1;j<=n;j++)
	{
		bool flag=false;
		int i,count=0;
		for(i=0;(i+j)<=n;i=i+j)
		{
			if(check(arr,i,i+j-1)==0)
			{
				flag=true;
				break;
			}
			count++;
		}
		if(!flag)
		{
			int s=0;
			int r=n%j;
			if(r!=0 && check(arr,n-1-r,n-1)==1)
				s=r;
			ll fact=getFact(j);
			ll x=1;
			for(int i=1;i<count;i++)
				x=(x*fact)%MODU;
			//printf("X=%lld COUNT=%d S=%d\n", x,count,s);
			x=(x*ncr(j,s))%MODU;
			sum=(sum+x)%MODU;
		}
		//printf("*****%lld\n", sum);
	}
	printf("%lld\n", sum);
	return 0;
}