S组T1

#include <bits/stdc++.h>
using namespace std;
int n, num;
priority_queue <int> p;
queue <int> q;

int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		int x;
		cin >> x;
		x *= -1;
		p.push(x);
	}
	while (!p.empty()) {
		int i = p.top() * -1;
		p.pop();
		if (q.front() < i) {
			q.pop();
			num++;
			q.push(i);
		} else {
			q.push(i);
		}
	}
	cout << n - num << endl;
	return 0;
}