#include <bits/stdc++.h>  // {{{

// https://codeforces.com/blog/entry/96344

#pragma GCC optimize("O2,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

using namespace std;

template <typename T>
constexpr T MIN = std::numeric_limits<T>::min();

template <typename T>
constexpr T MAX = std::numeric_limits<T>::max();

template <typename T>
[[nodiscard]] static T sc(auto&& x) {
  return static_cast<T>(x);
}

template <typename T>
[[nodiscard]] static T sz(auto&& x) {
  return static_cast<T>(x.size());
}

using ll = long long;
using ld = long double;
template <typename T>
using vec = std::vector<T>;
template <typename T, size_t N>
using arr = std::array<T, N>;

#define ff first
#define ss second
#define eb emplace_back
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
//  }}}

int n;
void solve() {
  cin >> n;
  vec<pair<ll, int>> a(n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i].ff;
    a[i].ss = i;
  }
  sort(all(a), [](auto& l, auto& r) {
    return l.ff < r.ff;
  });
  ll ans = 1;
  int last_i = a[0].ss;

  for (int i = 1; i < sz<int>(a); ++i) {
    if (a[i].ss < last_i) {
      ++ans;
    }
    last_i = a[i].ss;
  }

  cout << ans << endl;
}

int main() {  // {{{
  cin.tie(nullptr)->sync_with_stdio(false);

  solve();

  return 0;
}
// }}}