#include <bits/stdc++.h>
#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define ff first
#define ss second
#define dbg(x) cerr << #x << " = " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vvi = vt< vt<int> >;
const int N = 1e6 + 5, mod = 1e9 + 7, inf = 1e18 + 7, B = 500, LIM = (1ll << 60);
const double eps = 1e-6;
int n;
void solve () {
cin >> n;
vt<int> a(n + 1);
for (int i = 1; i <= n; i++) cin >> a[i];
int l = 1, r = 1, ans = 0;
set<int> v;
v.insert(N);
while (r <= n) {
v.insert(a[r]);
int x = *upper_bound(all(v), a[r]);
l = r;
while (l + 1 <= n && a[l + 1] >= a[l] && a[l + 1] <= x) v.insert(a[++l]);
r = l + 1;
ans++;
}
cout << ans;
cout << '\n';
}
bool testcases = 0;
signed main() {
cin.tie(0) -> sync_with_stdio(0);
int test = 1;
if (testcases) cin >> test;
for (int cs = 1; cs <= test; cs++) {
solve();
}
}
