#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int n;
    cin >> n;
    
    vector<int> nums(n);
    
    for(int i=0; i<n; i++)
        cin >> nums[i];
    
    unsigned long long count = 0;
    unsigned long long mod = (unsigned long long)pow(10,9)+7;
   
    vector<int>::iterator first,last;
    int chuncks;
    bool valid = true;
    
    for(int Vsize = 1; Vsize<=n; Vsize++)
    {
        chuncks = ceil(n/Vsize);  
        first = nums.begin();
        for(int i=0; i<chuncks-1; i++)
        {            
            if( !is_sorted(first,first+Vsize+1) )
            {
                valid=false;
                break;
            }
            advance(first,Vsize);
        }
        
        if(valid && is_sorted(next(nums.begin(),Vsize*(chuncks-1)),nums.end()))
            count++;
    }
    
    count++;
    
    cout << count%mod << endl;
    
    
    return 0;
}