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

int N;
multiset<int> A;
multiset<int> B;
bool T[201];

int main() {
  while (cin >> N) {
    if (N == 0) break;
    A.clear(), B.clear();
    for (int i=0; i<=2*N; i++) T[i] = false;
    for (int i=0; i<N; i++) {
      int t;
      cin >> t;
      T[t] = true;
    }
    for (int i=1; i<=2*N; i++) {
      if (T[i]) A.insert(i);
      else      B.insert(i);
    }
    int turn = 0, x = -1;
    while (!A.empty() && !B.empty()) {
      if (turn == 0) {
        auto i = lower_bound(A.begin(), A.end(), x);
        if (i == A.end()) {
          x = -1;
          turn ^= 1;
          continue;
        }
        x = *i;
        A.erase(i);
      }
      if (turn == 1) {
        auto i = lower_bound(B.begin(), B.end(), x);
        if (i == B.end()) {
          x = -1;
          turn ^= 1;
          continue;
        }
        x = *i;
        B.erase(i);
      }
      turn ^= 1;
    }
    cout << B.size() << "\n";
    cout << A.size() << "\n";
  }
  return 0;
}