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

int main() {
	int n ; 
	cin>>n; 
	unordered_map<int , int> k ; 
	for(int i =0 ; i<n; i++){
		int y ; 
		cin>>y; 
		k[y]= k[y]+1; 
		
	}
	int minfreq = INT_MAX; 
	int maxfreq=0 ; 
	int minelem=-1; 
	int maxelem= -1 ; 
	
	for(auto itr= k.begin();itr !=k.end();++itr){
		int count = itr->second; 
		int number= itr-> first; 
		if (count< minfreq){
			minfreq= count; 
			minelem= number; 
			
		}
		
		if (count> maxfreq){
			maxfreq= count; 
			maxelem= number; 
		}
	}
	cout<< maxelem <<"-->"<< maxfreq<<" "; 
	cout<< minelem <<"-->" << minfreq<<" ";
	// your code goes here
	return 0;
}