Max
시간 제한: 2000ms메모리 제한: 1024MB출처: NOI 2001BOJ 9913
문제
In a sequence of integers, the number of times an integer occurs is called the frequency of the integer. Given a sequence of integers, find the highest frequency.
입력
The first line contains a single integer N (1 ≤ N ≤ 10000) denoting the number of integers in the sequence. Each of the subsequent N lines contains an integer n (1 ≤ n ≤ 1000) in the sequence.
출력
The output contains an integer that is the highest frequency of the sequence.
예제
예제 1
입력
12 1 2 5 6 3 7 11 345 754 2 5 2
출력
3
예제 2
입력
7 2 4 6 7 7 2 4
출력
2
코드를 제출하려면 로그인하세요.