#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main(){
	int n;
	while( cin >> n , n ){
		vector<int> p1, p2;
		int field = 0;
		
		for(int i=0 ; i < n ; i++ ){
			int a;
			cin >> a;
			p1.push_back( a );
		}
		sort( p1.begin() , p1.end() );
		for(int i=1 ; i <= 2*n ; i++ ){
			if( count( p1.begin() , p1.end() , i ) == 0 ){
				p2.push_back( i );
			}
		}
		
		bool p1_flag = true, p2_flag = true;
		while( p1_flag || p2_flag ){
			p1_flag = false;
			p2_flag = false;
			for(int i=0 ; i < p1.size() ; i++ ){
				if( field < p1[i] ){
					field = p1[i];
					p1_flag = true;
					p1.erase( remove( p1.begin() , p1.end() , p1[i] ) , p1.end() );
					break;
				}
			}
			if( p1_flag == false ){
				field = 0;
			}
			if( p1.empty() ) break;
			
			for(int i=0 ; i < p2.size() ; i++ ){
				if( field < p2[i] ){
					field = p2[i];
					p2_flag = true;
					p2.erase( remove( p2.begin() , p2.end() , p2[i] ) , p2.end() );
					break;
				}
			}
			if( p2_flag == false ){
				field = 0;
			}
			if( p2.empty() ) break;
		}
		cout << p2.size() << endl;
		cout << p1.size() << endl;
	}
}