#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define pb push_back
#define lv v+v
#define rv v+v+1
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair <long long, long long>;
using pii = pair <int,int>;
using pld = pair <long double, long double>;
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")
long long mod = 1e9 + 7;
const ll N = 1e6 + 10;
const ll M = 1e6 + 10;
const ll P = 311;
const ld EPS = 1e-7;
const ll block = 450;
const ll inf = 1e18;
ll n,a[N],ans;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
ll _=1; //cin>>_;
while(_--) {
cin>>n;
for(ll i = 1; i<=n; i++) {
cin>>a[i];
}
set <ll> s;
s.insert(inf);
bool ok = true;
ll r;
for(ll block = 1, i=1; block <= n && i <= n; block++, i++) {
ans = block;
if(ok) {
r = *s.upper_bound(a[i]);
}
s.insert(a[i]);
if(a[i] == a[i+1] || r == a[i+1]) {
block--;
ok = false;
continue;
}
if(a[i] > a[i+1]) {
ok = true;
continue;
}
if(r == *s.upper_bound(a[i+1])) {
block--;
continue;
}
}
cout<<ans;
}
return 0;
}
// equal, min, max, 1, random, build
/*
6
3 6 4 5 1 2
*/
