#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using VI = vector<int>;
using PII = pair<int,int>;
using VVI = vector<vector<int>>;
const ll mod = 998244353;
const ll INF = 1e18;
const int N = 2e5 + 10;
void solve(){
	
}
int n;
int a[N];
int nex[N];
int pre[N];
int main() {
	ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
   //int T;cin>>T;while(T--)solve();
    cin>>n;
    for(int i = 1 ; i <= n ; i++) cin>>a[i];
    
    for(int i = 1 ; i <= n ; i++){
    	nex[i] = i + 1;
    	pre[i] = i - 1;
    }
    
    set<int> s;
    for(int i = 1 ; i <= n ; i++){
    	if(a[i] < a[i + 1] || a[i] < a[i - 1]){
    		s.insert(i);
    	}
    }
   /* for(auto x : s){
    	cout<<x<<" ";
    }*/
    int ct = 0;
    VI vis(n + 1 , 0);
    for(int i = 1 ; i <= n ; i++){
    	set<int> tmp;
    	for(auto x : s){
    		vis[x] = 1;
    		nex[pre[x]] = nex[x];
    		pre[nex[x]]	= pre[x];
    		if(pre[x] != 0) tmp.insert(pre[x]);
    		if(nex[x] != n + 1) tmp.insert(nex[x]);
    		//if(a[pre[x]] < a[nex[x]]) tmp.insert(pre[x]);
    		//else tmp.insert(nex[x]);
    	}
    	
    	//for(auto x : tmp) cout<<x<<" ";
		s.clear();
		    	
    	for(auto x : tmp){
    		if(vis[x]) continue;
    		if(a[x] > a[pre[x]] && a[x] > a[nex[x]]) continue;
    		s.insert(x);
    	}
    	
    	if(s.size() == 0){
    		 ct = i ;
    		 break;
    	}
    	
    	
 
    	
    }
    
    
    
    cout<<ct<<"\n";
    
    
    
    
}


//5 4 3 2 1
//5 4 3 2 1