#include<fstream> 
#include<vector>
#include<algorithm>
using namespace std; 
ifstream in("elmaj.in"); 
ofstream out("elmaj.out"); 
int main() 
{int n,maxim,ind;
	in>>n; 
	vector<int> v(n+1);
	vector<int> size(n+1);
	
	for(size_t i=0;i<n;i++) 
		size[i]=0;
	
	for(size_t i=0;i<n;i++) 
		in>>v[i]; 
	
	sort(v.begin(),v.end()); 
	
	for(size_t i=0;i<n;i++) 
		
		if(v[i]==v[i+1]) 
			size[v[i]]++; 
		else 
			if(v[i]!=v[i+1]) 
				size[v[i]]++;
		
		maxim=0;
		for(size_t j=0;j<n;j++) 
		{ 
			if(size[j]>maxim) 
			{
				maxim=size[j]; 
				ind=j; 
			}
		}
		
		out<<ind<<" "<<maxim; 
}