#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

int main(int argc, char **argv) {
	int N, a[2], t;
	cin >> N;
	cin >> a[0];
	a[1] = -1;
	REP(i, N - 1) {
		cin >> t;
		if (t != a[0]) a[1] = t;
	}
	if (a[1] == -1) {
		if (a[0] / (N - 1) == 2) cout << N << " " << 0 << endl;
		else cout << 0 << " " << N << endl;
	}
	else {
		int s = max(a[0], a[1]) + 2;
		cout << (2 * N - s / 2) << " " << (s / 2 - N) << endl;
	}
	return 0;
}