#include<bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
using namespace std;
ll n,a[2000005],ans,x;
set<ll>st;
set<ll>::iterator it;
int main(){
std::ios::sync_with_stdio(false);
cin >> n;
for(int i=1; i<=n; i++){
cin >> a[i];
}
for(int i=1; i<=n; i++){
//cout << i << endl;
if(st.size()){
if((*st.begin()) > a[i]){
x = (*st.begin());
}
else {
it = st.upper_bound(a[i]);
if(it == st.end())x = 999999999999999;
else x = (*it);
}
}
else {
x = 9999999999999;
}
//cout << x << "<--\n";
ll l = i + 1;
while(a[l] >= a[l-1] && a[l] <= x){
l++;
}
for(int j=i; j<l; j++){
st.insert(a[j]);
}
i = l - 1;
ans++;
}
cout << ans;
return 0;
}
