#include<iostream>
#include<string>
#include<vector>
#include<iterator>
#include<algorithm>
using namespace std;
int main(){
  int n;
  cin >> n;
  vector<int> v(n);
  vector<int> buf;
  for(int i=0;i<n;i++)
    cin >> v[i];
  int cur =0;
  int cnt=0;
  int counter=0;
  do{
    cnt=0;
    cur=0;
    for(int i=0;i<v.size();i++){
      if(cur<v[i]){
        cur=v[i];
      }else{
        cnt++;
        buf.push_back(v[i]);
        v.erase(v.begin()+i);
        i--;
      }
    }
    sort(buf.begin(),buf.end());
    buf.insert(buf.end(),v.begin(),v.end());
    v.clear();
    v.shrink_to_fit();
    copy(buf.begin(),buf.end(),back_inserter(v));
    buf.clear();
    buf.shrink_to_fit();
    counter+=cnt;
  }while(cnt);
  cout<<counter<<endl;
  return 0;
}