#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define pb push_back
#define lv v+v
#define rv v+v+1
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair <long long, long long>;
using pii = pair <int,int>;
using pld = pair <long double, long double>;
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")
long long mod = 1e9 + 7;
const ll N = 1e6 + 10;
const ll M = 1e6 + 10;
const ll P = 311;
const ld EPS = 1e-7;
const ll block = 450;
const ll inf = 1e18;
ll n,a[N],pos[N],ans;
pll b[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
ll _=1; //cin>>_;
while(_--) {
cin>>n;
for(ll i = 1; i<=n; i++) {
cin>>a[i];
b[i] = {a[i], i};
}
sort(b+1,b+1+n);
set <ll> s;
for(ll i = 1; i<=n; i++) {
pos[b[i].S] = i;
s.insert(i);
}
s.insert(0);
s.insert(n+1);
ll lst;
pos[n+1] = n+1;
for(ll i = n; i>0; i--) {
s.erase(pos[i]);
ans++;
if(*s.upper_bound(pos[i]) == *s.upper_bound(pos[i+1]) && pos[i+1] > pos[i]) {
//cout<<a[i]<<" ";
ans--;
}
}
cout<<ans-1;
}
return 0;
}
// equal, min, max, 1, random, build
/*
6
3 6 4 5 1 2
*/
