CCF-201312-1

#include<iostream>
#include<algorithm>
#include<map>
/* The sample input  
6
10 1 10 20 30 20
*/ 
using namespace std;
int main(){
	map<int,int> maps;
	int n;cin>>n;// Given n A positive integer , Number of self input 
	int number[1000];// Definition 1000 The size of an array 
	for(int i=0; i<n; i++){
		cin>>number[i];
	} // Manually enter the given n Number ;
	sort(number,number+n);
	for(int i=0; i<n; i++){
		maps[number[i]]++;
	} // take map For recording 
	int max = maps[number[0]];
	int id = 0; 
	for(int i = 0; i<n; i++){// Find the maximum number of occurrences  
		if(maps[number[i]] > max){
			max = maps[number[i]];
			id = i;
		}
	}
	cout << number[id];
	int k;
	cin>>k; 
	
	
	
	return 0;
	
	
	
}