/*
IN THE NAME OF GOD
*/
#include <bits/stdc++.h>
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;
#define F first
#define S second
#define Mp make_pair
#define pb push_back
#define pf push_front
#define size(x) ((ll)x.size())
#define all(x) (x).begin(),(x).end()
#define kill(x) cout << x << '\n', exit(0);
#define fuck(x) cout << "(" << #x << " , " << x << ")" << endl
#define endl '\n'
const int N = 1e6+23, lg = 20;
ll Mod = 1e9+7; //998244353;
inline ll MOD(ll a, ll mod=Mod) {a%=mod; (a<0)&&(a+=mod); return a;}
inline ll poww(ll a, ll b, ll mod=Mod) {
ll ans = 1;
a=MOD(a, mod);
while (b) {
if (b & 1) ans = MOD(ans*a, mod);
b >>= 1;
a = MOD(a*a, mod);
}
return ans;
}
int n, a[N], dp[N], ptr=1;
set<pii> st;
int main () {
ios_base::sync_with_stdio(false), cin.tie(0);
cin>>n;
for(int i=1; i<=n; i++) {
cin>>a[i];
}
dp[1] = 1;
for(int i=2; i<=n; i++) {
if(a[i] < a[i-1]) {
while(ptr<i) {
st.insert({a[ptr], ptr});
ptr++;
}
dp[i] = dp[i-1] + 1;
continue;
}
while(ptr < i) {
auto it = st.lower_bound(Mp(a[ptr], n+1));
if(it==st.end() || (*it).F >= a[i]) {
int x = 0;
if(size(st)==0 || it==st.begin()) x = 1;
else {
it--;
if((*it).F <= a[ptr]) x=1;
}
if(x==1) break;
}
st.insert(Mp(a[ptr], ptr));
ptr++;
}
dp[i] = dp[ptr-1] + 1;
}
cout<<dp[n]<<endl;
return 0;
}
