#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sz size()
#define ff first
#define ss second
#define pb push_back
#define pii pair <int, int>
#define dur exit(0)
#define dur1 return(0)
const int N = 1e6 + 5;
int a[N];
multiset <int> m1;
int main () {
// freopen ("input.txt", "r", stdin);
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
if (i == 1) {
m1.insert (a[i]);
}
}
int jogap = 1, last = 1;
for (int i = 2; i <= n; ++i) {
int ok = 0;
if (a[i] >= a[i - 1]) {
auto tr = m1.upper_bound (a[last]);
if (tr == m1.end()) {
ok = 1;
}
else {
int tt = *tr;
if (tt >= a[i]) {
ok = 1;
}
}
}
if (!ok) {
jogap++;
last = i;
}
m1.insert (a[i]);
}
cout << jogap;
}
