#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>
#include <numeric>
#include <bitset>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define minimize(a, x) a = std::min(a, x)
#define maximize(a, x) a = std::max(a, x)

typedef long long ll;
int const inf = 1<<29;

int main() {

  int N; cin >> N;
  int A[N];
  rep(i, N) {
    cin >> A[i];
  }

  vector<int> v(N);

  rep(i, N) {
    A[i] += 2;
    bool ok = 1;
    rep(j, N) {
      if(i == j)continue;
      if(!(A[i]-A[j]==2||A[i]-A[j]==4)){ ok = 0; break;}
    }
    A[i] -= 2;
    if(ok) {
      v[i] = 2;
    }
    else {
      v[i] = 4;
    }
  }

  int tsuru = 0, kame = 0;
  rep(i, N) {
    tsuru += v[i]==2;
    kame += v[i]==4;
  }

  cout << tsuru << " " << kame << endl;

  return 0;
}