#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <sstream>
#include <complex>
#include <ctime>
#include <cassert>
#include <functional>

using namespace std;

typedef long long ll;
typedef vector<int> VI;
typedef pair<int,int> PII;

#define REP(i,s,t) for(int i=(s);i<(t);i++)
#define FILL(x,v) memset(x,v,sizeof(x))

const int INF = (int)1E9;
#define MAXN 2005

int n;
bool alice[MAXN], bob[MAXN];
int solve(bool a[MAXN], bool b[MAXN]) {
  int p = 0, ans = 0;
  for (int i = 2 * n; i >= 1; i--) {
    if (a[i]) p++;
    else {
      if (p > 0) {
        p--;
        ans++;
      }
    }
  }
  return ans;
}
int main() {
  cin >> n;
  REP(i,0,n) {
    int x;
    cin >> x;
    alice[x] = true;
  }
  REP(i,1,2*n+1) bob[i] = !alice[i];
  cout << n - solve(bob, alice) << " " << solve(alice, bob) << endl;
  return 0;
}