Submission

Status:

PPPPPPPPPP

Subtask/Task Score:

100/100

Score: 100

User: dddrrrr

Problemset: กองชาม

Language: cpp

Time: 0.007 second

Submitted On: 2025-10-16 17:46:17

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



int main(){
	cin.tie(0)->sync_with_stdio(0);
	int n;
	cin >> n;
	
	unordered_map <int ,int> mp;
	int mx_freq = INT_MIN;
	for(int i=0 ;i<n ;i++){
		int x;
		cin >> x;
		mp[x]++;
		
		mx_freq = max(mx_freq ,mp[x]);
	}
	cout << mx_freq;	
	
	return 0;
	
}