#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ll long long
#define ld long double
#define all(_v) _v.begin(), _v.end()
#define sz(_v) (int)_v.size()
#define pii pair <int, int>
#define pll pair <ll, ll>
#define veci vector <int>
#define vecll vector <ll>
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
const double PI = 3.1415926535897932384626433832795;
const double eps = 1e-9;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;
const int MAXN = 1e6 + 10;
int n;
int a[MAXN];
void solve() {
cin >> n;
for(int i = 1; i <= n; ++i) cin >> a[i];
int ans = 0;
set <int> st;
st.insert(1e9);
for(int i = 1; i <= n; ) {
int j = i + 1;
int val = *st.upper_bound(a[i]);
st.insert(a[i]);
while(j <= n && a[j] >= a[j - 1] && a[j] <= val) st.insert(a[j]), ++j;
++ans;
i = j;
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int CNT_TESTS = 1;
///cin >> CNT_TESTS;
for(int NUMCASE = 1; NUMCASE <= CNT_TESTS; ++NUMCASE) {
solve();
if(NUMCASE != CNT_TESTS) cout << '\n';
}
return 0;
}
