#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 1000005;
const int inf = 1e9 + 5;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k) print the k-th smallest number in os(0-based)
int n;
int niz[maxn];
int cnt[maxn];
bool seku(int l1, int r1, int l2, int r2) {
return !(l1 > r2 || l2 > r1);
}
int main()
{
ios::sync_with_stdio(false);
cout.tie(nullptr);
cin.tie(nullptr);
cin >> n;
ff(i,1,n)cin >> niz[i];
// prvi segment ide sve dok je rastuci
ordered_set<pii> os;
os.insert({niz[1], 1});
cnt[niz[1]] += 1;
int o = 1;
while(o + 1 <= n && niz[o + 1] >= niz[o]) {
o += 1;
cnt[niz[o]] += 1;
os.insert({niz[o], o});
}
int br = 1;
ff(i,o + 1,n) {
br += 1;
int L = os.order_of_key({niz[i], -1});
int R = L + cnt[niz[i]];
int j = i;
while(j + 1 <= n && niz[j + 1] >= niz[j]) {
int A = os.order_of_key({niz[j + 1], -1});
int B = A + cnt[niz[j + 1]];
if(seku(L, R, A, B)) {
j += 1;
continue;
}
break;
}
ff(l,i,j) {
os.insert({niz[l], l});
cnt[niz[l]] += 1;
}
i = j;
}
cout << br << '\n';
return 0;
}
/**
10
5 3 5 5 8 2 3 7 5 10
10
9 9 10 4 4 7 9 1 5 5
6
3 6 4 5 1 2
// probati bojenje sahovski ili slicno
**/
