#include <bits/stdc++.h>  
using namespace std;  

#define int long long  

template <typename T>
struct Fenwick {
    int n;
    vector<T> a;
    Fenwick(int n_ = 0) {
        init(n_);
    }    
    void init(int n_) {
        n = n_;
        a.assign(n + 1, T{});
    }	    
    void add(int x, const T &v) {
        for (int i = x; i <= n; i += i & -i) {
            a[i] = a[i] + v;
        }
    }
    T sum(int x) {
        T ans{};
        for (int i = x; i > 0; i -= i & -i) {
            ans = ans + a[i];
        }
        return ans;
    }
    T rangeSum(int l, int r) {
        return sum(r) - sum(l - 1);
    }
    // 权值树状数组，查询第k小
    int select(const T &k) {
        int x = 0;
        T cur{};
        for (int i = 1 << __lg(n); i; i /= 2) {
            if (x + i < n && cur + a[x + i] < k) {
                x += i;
                cur = cur + a[x];
            }
        }
        return x + 1;
    }
};

vector<int> discrete(const vector<int> &a) {
	auto tmp = a;
	sort(tmp.begin(), tmp.end());
	sort(tmp.begin() + 1, tmp.end());
	tmp.erase(unique(tmp.begin() + 1, tmp.end()), tmp.end());
	vector<int> ret(a.size());
	for (int i = 1; i < a.size(); i++) {
		ret[i] = lower_bound(tmp.begin() + 1, tmp.end(), a[i]) - tmp.begin();
	}
	return ret;
}

signed main() {  
    ios::sync_with_stdio(false);
    cin.tie(nullptr);  

	int n;
	cin >> n;

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

	a = discrete(a);

	auto ta = a;
	sort(ta.begin(), ta.end());

	Fenwick<int> f(n);

	int ans = 0;
	
	for (int i = 1; i <= n; i++) {
		f.add(a[i], 1);
		if (f.sum(ta[i]) == i) {
			ans++;
		}	
	}

	cout << ans << "\n";

    return 0;
}