#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector<int> a;
int b[100001],n,maxp,maxv,maxc=-(2e9);
int main(){
	freopen("elmaj.in", "r", stdin);
	freopen("elmaj.out", "w", stdout);
	int e,x;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
    	scanf("%d",&x);
    	e=find(a.begin(),a.end(),x) - a.begin();
    	if(e==i-1){
    		a.push_back(x);
    	}else{
    		b[e]++;
    		if(b[e]>maxc){
    			maxc=b[e];
    			maxv=x;
    			maxp=e;
    		}
    	}
    }
	cout<<maxv<<" "<<b[maxp]+1;
}