//AOJ0523

#include <iostream>

int main(){
	int n;
	while (std::cin >> n, n){
		int taro[201], hanako[201];
		for (int i = 0; i < 201; ++i)taro[i] = 0, hanako[i] = 0;
		for (int i = 0; i < n; ++i){
			int a;
			std::cin >> a;
			taro[a] = 1;
		}
		for (int i = 1; i <= 2 * n; ++i){
			if (taro[i] != 1)hanako[i] = 1;
		}
		int t = n, h = n;
		int ba = 0;
		char turn = 't';
		bool f = true;
		while (t > 0 && h > 0){
			switch (turn){
			case 't':
				f = true;
				for (int i = 0; i <= n * 2; ++i){
					if (ba < i && taro[i] == 1){
						t--;
						ba = i;
						taro[i] = 0;
		//				std::cout << i << std::endl;

						f = false;
						break;
					}
				}
				if (f)ba = 0;
				turn = 'h';
				break;
			case 'h':
				f = true;
				for (int i = 0; i <= n * 2; ++i){
					if (ba < i && hanako[i] == 1){
						h--;
						ba = i;
						hanako[i] = 0;
	//					std::cout << i << std::endl;
						f = false;
						break;
					}
				}
				if (f)ba = 0;
				turn = 't';
				break;
			}
		}
		std::cout << h << std::endl;
		std::cout << t << std::endl;
	}
	//system("pause");
}