#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define ull unsigned long long
#define mp make_pair
#define si short int
#define speed ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define pill pair<ll,ll>
#define f first
#define s second
#define pilc pair<ll,char>
#define all(a) (a).begin(),(a).end()
#define rep(s,e,step) for(int i = (s); i < (e) ; i += step)
#define vrep(s,e,step) for(int j = (s); j < (e) ; j += step)
#define ex exit(0)
#define sz(a) (a).size()
#define triple pair<pill, ll>
#define pinode pair<node*, node*>
#define quadra pair<pill, pill>
#define ld long double
using namespace std;
const ll N = 1e6 + 10;
const ll M = 1e4 + 10;
const ll big = 1e17;
const ll hsh2 = 1964325029;
const long long mod = 1e9 + 7;
const long double EPS = 1e-10;
const ll block = 1e7;
const ll shift = 2e3;
const ld pi = acos(-1.0);
ll n, m;
ll a[N], was[N];
ll t[4 * N];
void upd(ll p, ll v = 1, ll tl = 1, ll tr = 1e6) {
if(tl == tr)
return (void)(t[v]++);
ll m = (tl + tr) >> 1ll;
if(p <= m)
upd(p, v * 2, tl, m);
else
upd(p, v * 2 + 1, m + 1, tr);
t[v] = t[v * 2] + t[v * 2 + 1];
}
ll get(ll l, ll r, ll v = 1, ll tl = 1, ll tr = 1e6) {
if(l > tr || tl > r)
return 0;
if(l <= tl && tr <= r)
return t[v];
ll m = (tl + tr) >> 1ll;
return get(l, r, v * 2, tl, m) + get(l, r, v * 2 + 1, m + 1, tr);
}
int main() {
speed;
cin >> n;
ll ans = 1;
for(int i = 1; i <= n; i++) {
cin >> a[i];
}
ll str = -1;
for(int i = 1; i < n; i++) {
if(str == -1)
str = i;
if(a[i] > a[i + 1]) {
for(int j = str; j <= i; j++)
upd(a[j], 1);
ans++,str = -1;
}
else {
ll can = get(a[str] + 1, a[i + 1] - 1);
if(can) {
for(int j = str; j <= i; j++)
upd(a[j], 1);
str = -1;
ans++;
}
}
}
cout << ans << '\n';
}
/*
*/
