#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
typedef long long int lld;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)
bool in[2000000];
void solve(){
	int n;
	cin>>n;
	vector<pair<int,int> >V(n);
	rep(i,0,n){
		cin>>V[i].first;
		V[i].second=i;
	}
	rep(i,0,n)in[i]=false;
	sort(V.begin(),V.end());
	int ans=0;
	int imb=0;
	trav(a,V){
		int x=a.second;
		in[x]=true;
		if(x>0 && in[x-1]){
			imb++;
		}
		if(x<n-1 && in[x+1]){
			imb++;
		}
		imb--;
		if(imb==-1){
			ans++;
		}
	}
	cout<<ans<<"\n";
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt=1;
	//cin>>tt;
	while(tt--){
		solve();
	}
}