/*
ID: espr1t
TASK: 
KEYWORDS: 
*/

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <map>

using namespace std;
FILE *in; FILE *out;

const int MAX = 1024;

int n;
int a[MAX];

int main(void) {
	in = stdin; out = stdout;
	in = fopen("stats.in", "rt"); out = fopen("stats.out", "wt");
	
	fscanf(in, "%d", &n);
	for (int i = 0; i < n; i++)
	    fscanf(in, "%d", &a[i]);
	sort(a, a + n);
	int median = a[n / 2];
	map <int, int> q;
	for (int i = 0; i < n; i++)
	    q[a[i]]++;
	int mode = 0, maxx = 0;
	for (auto it = q.begin(); it != q.end(); it++) {
	    if (maxx < it->second) {
	        maxx = it->second;
	        mode = it->first;
        }
    }
    fprintf(out, "%d %d\n", median, mode);
	
	return 0;
}