#include <bits/stdc++.h>

using namespace std;

int nChoosek( unsigned n, unsigned k )
{
    if (k > n) return 0;
    if (k * 2 > n) k = n-k;
    if (k == 0) return 1;

    int result = n;
    for( int i = 2; i <= k; ++i ) {
        result *= (n-i+1);
        result /= i;
    }
    return result;
}

int main(){
    int n;
    cin >> n;
    vector<int> m(n);
    for(int m_i = 0; m_i < n; m_i++){
       cin >> m[m_i];
    }
    // your code goes here
    int count = 1;
    int size = 1;
    int minSize = INT_MAX;
    for(int i=1;i<m.size();i++){
        if(m[i] < m[i-1]){
            minSize = min(minSize, size);
            size=0;
        }
        size++;
    }
    
    minSize = min(size,minSize);
  //  cout << minSize << endl;
    for(int i=2;i<minSize;i++){
        int num = pow(i,floor(log(n)/log(i)));
        int mod = n%i;
     //   cout << "sjd " << mod << endl;
        count += num*nChoosek(num, nChoosek(i,mod));
    }
    if(minSize ==n) count++;
    
    cout << count << endl;
    return 0;
}