#include <bits/stdc++.h>
using namespace std;
int N;
int a[100];
int colors[8];
int count() {
  int r = 0;
  for (int i = 0; i < 8; i++) {
    r += colors[i];
  }
  return r;
}
void solve() {
  for (int i = 0; i < 8; i++) {
    colors[i] = 0;
  }
  int free = 0;
  for (int i = 0; i < N; i++) {
    int s = a[i];
    if (1 <= s && s <= 399) {
      colors[0] = 1;
    } else if (400 <= s && s <= 799) {
      colors[1] = 1;
    } else if (800 <= s && s <= 1199) {
      colors[2] = 1;
    } else if (1200 <= s && s <= 1599) {
      colors[3] = 1;
    } else if (1600 <= s && s <= 1999) {
      colors[4] = 1;
    } else if (2000 <= s && s <= 2399) {
      colors[5] = 1;
    } else if (2400 <= s && s <= 2799) {
      colors[6] = 1;
    } else if (2800 <= s && s <= 3199) {
      colors[7] = 1;
    } else {
      free++;
    }
  }
  cout << max(1, count()) << ' ' << min(count() + free, 8) << endl;
}
int main() {
  cin >> N;
  for (int i = 0; i < N; i++) {
    cin >> a[i];
  }
  solve();
}
