#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <map>
#include <iomanip>
#include <math.h> 
#include <stack>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <tuple>
#include <cctype>
#include <ctype.h>
#include <set>
#include <sstream>
#include <time.h>
using namespace std;
//#define int long long
#define rep(i,s,n) for(int i = s;i<n;i++)
#define repe(i,s,n) for(int i = s;i<=n;i++)
#define rrep(i,s,n) for(int i = (n)-1;i>=(s);i--)
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define fi first
#define se second
#define chmin(a,b) a=min((a),(b))
#define chmax(a,b) a=max((a),(b))
#define l1 list[index]
#define l2 list[index - 1]
#define l3 list[index + 1]
#define iif(i,j) ((i<0 && j<0) || (i>0 && j>0)) ? true : false 
typedef long long ll;
typedef pair<int, int>pint;
typedef vector<int>vint;
typedef vector<pint>vpint;
typedef pair<pint, int> P1;
typedef pair<int, pint> P2;
typedef pair<pint, pint> PP;
static const ll maxLL = (ll)1 << 62;
const ll MOD = 1000000007;
const ll INF = 1e18;
int ca[12] = { 31,28,31,30,31,30,31,31,30,31,30,31 };

int n, ko, tuko, kako, nibame;
bool flag = false;

int func(int cnt, int sum, int tu, int ka, int syo) {

	if (flag == true) {
		return 0;
	}


	if (cnt == n - 1 && sum == ko) {
		flag = true;
		tuko = tu;
		kako = ka;
		//nibame = syo;
		return 0;
	}


	if (cnt >= n - 1) {
		return 0;
	}

	if (cnt == 0) {
		func(cnt + 1, sum + 2, tu + 1, ka, 2);
		func(cnt + 1, sum + 4, tu, ka + 1, 4);
	}
	else {
		func(cnt + 1, sum + 2, tu + 1, ka, syo);
		func(cnt + 1, sum + 4, tu, ka + 1, syo);
	}


	return 0;
}

signed main() {
	

	cin >> n;

	//int list2[n];
	vector<int>list(n);

	map<int,int>mp;

	for (int i = 0; i < n; i++) {
		cin >> list[i];
		mp[list[i]]++;
	}

	ko = list[0];

	func(0, 0, 0, 0, 0);

	auto itr = mp.begin();
	int a = (*itr).second;
	itr++;
	int b = (*itr).second;

	if (tuko == kako) {
		if (a > b) {
			kako++;
		}
		else {
			tuko++;
		}
	}
	else {
		if (a == tuko && b == kako + 1) {
			kako++;
		}
		else if (a == tuko + 1 && b == kako) {
			tuko++;
		}
		else if (a == kako && b == tuko + 1) {
			tuko++;
		}
		else if (a == kako + 1 && b == tuko) {
			kako++;
		}
	}


	cout << tuko << " " << kako << endl;



	getchar();
	getchar();
	return 0;
}