//#pragma GCC optomize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC target("sse,sse2,sse4.1,sse4.2")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define max_heap priority_queue<pair <ll, pair <ll, ll>>>
#define min_heap priority_queue<pair <ll, ll>, vector<pair <ll, ll>>, greater<pair <ll, ll>>>
#define sariE cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false);
#define filE freopen("in.txt", "r", stdin);// freopen("out1.txt", "w", stdout);
#define endl '\n'
#define md(a) (a % mod + mod) % mod
#define pb push_back
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//cout << setprecision(5) << fixed << f;
//hash prime = 769
ll const maxn = 1e6 + 123;
ll const inf = 3e18;
ll const loG = 18; // 23
ll const mod = 1e9 + 7;
//ll const mod = 998244353;
ll const sq = 500;
ll power(ll a, ll b, ll mod){if(b==0)return 1;if(b==1)return a;ll x = power(a, b / 2, mod);return (((x * x) % mod) * (b % 2 ? a : 1)) % mod;}
ll n, arr[maxn], ans;
set <ll> st;
void Solve(){
cin >> n;
for (int i = 1; i < n + 1; i++)
cin >> arr[i];
arr[n + 1] = inf;
st.insert(inf);
ll ind = 0;
while (ind < n){
ans++;
ind++;
ll last = ind;
ll x = *st.upper_bound(arr[ind]);
for (int i = ind; i < n + 1; i++){
if (arr[i] > x)
break;
last = i;
if (arr[i] > arr[i + 1]){
break;
}
}
for (int i = ind; i < last + 1; i++){
st.insert(arr[i]);
}
//cout << ind << ' ' << last << ' ' << x << endl;
ind = last;
}
cout << ans << endl;
}
int main(){
sariE;
//filE;
int test = 1;
//cin >> test;
while (test--) Solve();
return 0;
}
