#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VI a(n);
  rep(i, n) cin >> a[i];
  segtree<int, [](int x, int y) { return max(x, y); }, []() { return -1; }> seg_max(a);
  constexpr int INF = 1001001001;
  segtree<int, [](int x, int y) { return min(x, y); }, []() { return INF; }> seg_min(a);
  int ans = 0;
  rep(i, n) {
    int j = seg_max.max_right(i, [&](int x) { return x <= a[i]; });
    ans += (j == n || a[i] < a[j]) && (i == 0 || (seg_max.prod(0, i) == a[i] && seg_min.prod(0, i) == a[i]));
  }
  bool ok = false;
  for (int i = 1; i < n; i++) {
    if (ok || a[i-1] > a[n-1]) {
      ans += i == n - 1 || (seg_max.prod(i, n - 1) == a[i-1] && seg_min.prod(i, n - 1) == a[i-1]);
    }
    if (i == n - 1) break;
    if (a[i] < a[i+1]) break;
    if (a[i] > a[i+1]) ok = true;
  }
  cout << ans << '\n';
}