#include <bits/stdc++.h>
using namespace std;

#define GOTTAGOFAST cin.tie(0); ios::sync_with_stdio(0);

struct Node {
    int value;
    Node *next;
    Node *prev;
};

int main()
{
    GOTTAGOFAST

    int n;
    cin >> n;

    vector<Node> pontok(n+2);

    pontok[0].value = 1000001;
    pontok[0].next = &pontok[1];
    pontok[n+1].prev = &pontok[n];

    for(int i = 1; i <= n; i++)
    {
        cin >> pontok[i].value;
        pontok[i].prev = &pontok[i-1];
        pontok[i].next = &pontok[i+1];
    }

    int tval = pontok[n].value, inters = 0;
    bool cutt = false;
    Node *max = &pontok[n];
    Node *curr = max;
    Node *temp;

    while(true)
    {
        inters++;
        cutt = true;
        temp = max->prev;
        curr = max;

        max->prev->next = max->next;
        max->next->prev = max->prev;
        while(temp != &pontok[0])
        {
            if(cutt && temp->value >= curr->value)
            {
                max = temp;
                cutt = false;
            }

            if(temp->value < curr->value)
            {
                temp->prev->next = temp->next;
                temp->next->prev = temp->prev;
                curr = temp;
            }
            temp = temp->prev;
        }
        if(cutt) break;
    }

    cout << inters << "\n";

    return 0;
}