#include <iostream>
#include <algorithm>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)

int main() {
  int N;
  cin >> N;

  int count[9];
  REP(i, 9)
    count[i] = 0;

  REP(i, N) {
    int a;
    cin >> a;
    ++count[min(a / 400, 8)];
  }

  int min_val = 0, max_val = 0;
  if (count[8] == N) {
    min_val = 1;
    max_val = min(count[8], 8);
  } else {
    REP(i, 8) {
      if (count[i] != 0)
        ++min_val;
    }
    max_val = min(8, min_val + count[8]);
  }

  cout << min_val << " " << max_val << endl;
  return 0;
}


3200以上がいる・いない
色数が8色・それ以外