//include----------------------------------------------------------------------------------------------------------------------
#include <bits/stdc++.h>
//using namespace--------------------------------------------------------------------------------------------------------------
using namespace std;

//define-----------------------------------------------------------------------------------------------------------------------
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((a), 0 ,sizeof(a))
#define dump(x) cout << #x << " = " << (x) << "\n";
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)

//typedef----------------------------------------------------------------------------------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef priority_queue<int> maxpq;
typedef priority_queue< int, vector<int>, greater<int> > minpq;
//const------------------------------------------------------------------------------------------------------------------------
static const double EPS = 1e-10;
static const double PI = acos( -1.0 );
static const int mod = 1000000007;
static const int INF = 1 << 25;
static const LL LL_INF = 1152921504606846976;
//global-----------------------------------------------------------------------------------------------------------------------
int n;
set<int> taro_card, hanako_card;
//#define DEBUG
//function-------------------------------------------------------------------------------------------------------------------
int main() {
	while ( scanf( "%d", &n ) != EOF && n ) {
		rep( i, n ) {
			int b;
			scanf( "%d", &b );
			taro_card.insert( b );
		}
		FOR( i, 1, 2 * n + 1 ) {
			if ( taro_card.count( i ) ) {
				continue;
			}
			hanako_card.insert( i );
		}
		bool turn_taro = true;
		int now = 0;
		while ( taro_card.size() && hanako_card.size() ) {
			if ( turn_taro ) {
				set<int>::iterator it = taro_card.upper_bound( now );
				turn_taro = false;
				if ( it == taro_card.end() ) {
					now = 0;
					continue;
				}
				now = *it;
				taro_card.erase( it );
				continue;
			}
			else {
				set<int>::iterator it = hanako_card.upper_bound(  now );
				turn_taro = true;
				if ( it == hanako_card.end() ) {
					now = 0;
					continue;
				}
				now = *it;
				hanako_card.erase( it );
				continue;
			}
		}
		printf( "%d\n", hanako_card.size() );
		printf( "%d\n", taro_card.size() );
		taro_card.clear();
		hanako_card.clear();
	}
	return 0;
}

Measured memory_bytes: 1196