#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define pb push_back
#define endi puts("");
const int N = 1e6+12,INF=1e9+7;
int q[N],der[4*N];
void update(int v,int l,int r,int x){
if (l==r)
der[v]+=1;
else {
int m = l+r>>1;
if (x <= m)
update((v<<1),l,m,x);
else
update((v<<1)+1,m+1,r,x);
der[v]=der[v*2]+der[v*2+1];
}
}
int get_ans(int v,int l,int r,int ql,int qr){
if (r < ql || qr < l )ret 0;
if (ql <= l && r <= qr)ret der[v];
int m = l+r>>1;
ret get_ans(v<<1,l,m,ql,qr)+get_ans((v<<1)+1,m+1,r,ql,qr);
}
main(){
int n,j,i,ans=0,sum=1,l;
scan1(n)
for (i=1;i<=n;++i)scan1(q[i])
update(1,1,1000000,q[1]);
l=1;
for (i=2;i<=n;++i){
update(1,1,1000000,q[i]);
if (q[i] < q[i-1]){
ans++;
l=i;
}
else {
int x = get_ans(1,1,1000000,q[l],q[i])-get_ans(1,1,1000000,q[l],q[l])-get_ans(1,1,1000000,q[i],q[i]);
if (q[i] == q[l]){
x += get_ans(1,1,1000000,q[i],q[i]);
}
if (x > i-l-1){
ans++;
l = i;
}
}
}
cout <<ans+1;
}
