#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <list>
using namespace std;

int main(){
  int n, tmp;
  while(cin >> n, n){
    list<int> a, b;
    bool submited[201];
    memset(submited, false, sizeof(submited));
    for(int i = 0 ; i < n ; i++){
      cin >> tmp;
      a.push_back(tmp);
      submited[tmp] = true;
    }
    
    for(int i = 1 ; i <= 2*n ; i++){
      if(!submited[i]) b.push_back(i);
    }
    
    a.sort();
    b.sort();
    
    int now = 0;
    bool turn = true;
    list<int>::iterator it;
    while(!(a.size() == 0) && !(b.size() == 0)){
      if(turn){
	it = upper_bound(a.begin(), a.end(), now);
	if(it == a.end()){
	  turn = false;
	  now = 0;
	  continue;
	}
	now = *it;
	a.remove(*it);
	turn = false;
      }
      else{
	it = upper_bound(b.begin(), b.end(), now);
	if(it == b.end()){
	  turn = true;
	  now = 0;
	  continue;
	}
	now = *it;
	b.remove(*it);
	turn = true;
      }
    }
    
    cout << b.size() << endl << a.size() << endl;
  }
  return 0;
}


  