#include<iostream>
#include<fstream>
#include<climits>
#include<cmath>
#include<algorithm>

using namespace std;

int dp[100005];

int main()
{
    ifstream input("stats.in");
    ofstream output("stats.out");

    int n,k;
    int a[100005];

    int answer = 0;
    int max_number = 0;

    input >> n;
    for(int i = 0;i<n;i++)
    {
        input >> a[i];

        dp[a[i]]++;
        if(dp[a[i]]>max_number) {max_number = dp[a[i]];answer = a[i];}
    }
    sort(a,a+n);

    output << a[(n+1)/2-1] << " " << answer << endl;
}