#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
//Dijkstra->set
//set.find_by_order(x) x-position value
//set.order_of_key(x) number of strictly less elements don't need *set.??
#define N 1000005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second
int a[N];
int main ()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; i++){
cin >> a[i];
}
set<int> s;
int ans = 1, cur = -1;
s.insert(a[1]);
for (int i = 2; i <= n; i++){
if (a[i] == a[i-1]) continue;
if (a[i] > a[i-1] and (cur == -1 or cur == a[i])){
auto x = s.upper_bound(a[i-1]);
if (x == s.end());
else if (*x < a[i]) ans++;
else if (*x == a[i]) {cur = a[i];}
}else ans++, cur = -1;
s.insert(a[i]);
}
cout << ans << '\n';
}
