#include <bits/stdc++.h>

#define F first
#define S second
// #define int long long
#define double long double
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
#define mp(x, y) make_pair(x, y)
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define INF (int)1e18
using namespace std;

using pii = pair<int, int>;
using pdd = pair<double, double>;
using pbb = pair<bool, bool>;
using pcc = pair<char, char>;
using pss = pair<string, string>;
using vi = vector<int>;
using vd = vector<double>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vpii = vector<pair<int, int>>;
using vpdd = vector<pair<double, double>>;
using vpbb = vector<pair<bool, bool>>;
using vpcc = vector<pair<char, char>>;
using vpss = vector<pair<string, string>>;
using vvi = vector<vector<int>>;
using vvd = vector<vector<double>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvs = vector<vector<string>>;
using vvpii = vector<vector<pair<int, int>>>;
using vvpdd = vector<vector<pair<double, double>>>;
using vvpbb = vector<vector<pair<bool, bool>>>;
using vvpcc = vector<vector<pair<char, char>>>;
using vvpss = vector<vector<pair<string, string>>>;

// clang-format off
template <class T> using pq = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
template <class T> T sqrt_(T elem) {int l=1,r=elem;while(l<=r){int mid=l+(r-l)/2LL;if(mid>elem/mid){r=mid-1;}else{int val=mid*mid;if(val<=elem){l=mid+1;}else{r=mid-1;}}}return r;}
template <class T> T ceil_(T a,T b) {return(a+b-1)/b;};
template <class T> T mod_add(T a,T b,T mod){return((a%mod)+(b%mod))% mod;}
template <class T> T mod_sub(T a,T b,T mod){return((a%mod)-(b%mod)+mod)%mod;}
template <class T> T mod_mul(T a,T b,T mod){return((a%mod)*(b%mod))%mod;}
template <class T> T mod_inv(T a,T mod){T m0=mod,y=0,x=1;if(mod==1)return 0;while(a>1){T q=a/mod;T t=mod;mod=a%mod,a=t;t=y;y=x-q*y;x=t;}if(x<0)x+=m0;return x;}
template <class T> T mod_div(T a,T b,T mod){return mod_mul(a,mod_inv(b,mod),mod);}
// clang-format on
struct SegmentTree {
  int n;
  vector<long long> tree, lazy;

  SegmentTree(int size) {
    n = size;
    tree.assign(4 * n, 0);
    lazy.assign(4 * n, 0);
  }

  void push(int node, int l, int r) {
    if (lazy[node] != 0) {
      tree[node] += (r - l + 1) * lazy[node];

      if (l != r) {
        lazy[2 * node] += lazy[node];
        lazy[2 * node + 1] += lazy[node];
      }

      lazy[node] = 0;
    }
  }

  void add(int node, int l, int r, int ql, int qr, long long val) {
    push(node, l, r);

    if (qr < l || r < ql)
      return;
    if (ql <= l && r <= qr) {
      lazy[node] += val;
      push(node, l, r);
      return;
    }

    int mid = (l + r) / 2;
    add(2 * node, l, mid, ql, qr, val);
    add(2 * node + 1, mid + 1, r, ql, qr, val);
    tree[node] = tree[2 * node] + tree[2 * node + 1];
  }

  long long sum(int node, int l, int r, int ql, int qr) {
    push(node, l, r);

    if (qr < l || r < ql)
      return 0;
    if (ql <= l && r <= qr)
      return tree[node];

    int mid = (l + r) / 2;
    return sum(2 * node, l, mid, ql, qr) +
           sum(2 * node + 1, mid + 1, r, ql, qr);
  }

  void add(int l, int r, long long val) { add(1, 0, n - 1, l, r, val); }

  long long sum(int l, int r) { return sum(1, 0, n - 1, l, r); }
};

void solve() {
  int n;
  cin >> n;

  vi a(n + 1);
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }

  SegmentTree st1(n + 2);
  SegmentTree st2(n + 2);

  vi pre(n + 1), suff(n + 1);

  for (int i = 1; i <= n; i++) {
    pre[i] = st1.sum(0, a[i]);
    st1.add(a[i], a[i], 1LL);
  }

  for (int i = n; i >= 1; i--) {
    suff[i] = st2.sum(a[i], n);
    st2.add(a[i], a[i], 1LL);
  }

  int ans = 0;
  for (int i = 1; i <= n; i++) {
    if (max(pre[i], suff[i]) >= a[i]) {
      ans++;
    }
  }
  cout << ans << '\n';
  return;
}

signed main() {

  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

  int tt = 1, count = 1;
  // cin >> tt;
  while (tt--) {
    // cout << "Case #" << count << ": ";
    solve();
    ++count;
  }
  return 0;
}