#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define ld long double
#define f first
#define s second
#define mp make_pair
const ll maxn = 1e6 + 100, maxm = 3e5 + 1, maxk = 61;
const ll inf = 1000000000, mod = inf + 7, mod2 = 998244353;
const ll pa = 31, block = 400;
using namespace std;
int n;
int a[maxn], f[maxn];
void upd(int pos, int val){
for (int i = pos; i <= 1e6; i |= (i + 1)){
f[i] += val;
}
}
int get(int pos){
int res = 0;
for (int i = pos; i >= 1; i = (i & (i + 1)) - 1){
res += f[i];
}
return res;
}
int main(){
cin >> n;
for (int i = 1; i <= n; ++i){
cin >> a[i];
}
int pos = 1, ans = 0;
vector<int> v;
v.pb(0), v.pb(inf);
while (pos <= n){
int mx = 0, mn = inf, answ = pos;;
for (int j = pos; j <= n; ++j){
if ((j == pos) || (j - 1 >= pos && a[j] >= a[j - 1])){
mx = max(mx, a[j]);
mn = min(mn, a[j]);
int range = get(mx - 1) - get(mn);
range = max(range, 0);
if (range == 0){
answ = j;
}
else{
break;
}
}
else{
break;
}
}
ans++;
// cout << pos << " " << answ << '\n';
for (int j = pos; j <= answ; ++j){
upd(a[j], 1);
}
pos = answ + 1;
}
cout << ans;
}
