#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
using namespace std;
const int N = 1000006;
const int INF = 100000009;
int n;
int a[N];
int main()
{
ios_base::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
set <int> st;
st.insert(INF);
int ans = 0;
for (int i = 0; i < n; i++) {
int mx = *st.upper_bound(a[i]);
st.insert(a[i]);
while (i < n - 1 && a[i] <= a[i + 1] && a[i + 1] <= mx) {
st.insert(a[i + 1]);
i++;
}
ans++;
}
cout << ans << endl;
return 0;
}
