#include <bits/stdc++.h>
const int mod = 1000000007;
const int INF = 1LL << 30;
const long long int LLINF = 1LL << 60;
using namespace std;
int main() {
  int n, ct = 0, ch[8] = {}, free = 0;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    int nn;
    cin >> nn;
    bool b = 1;
    for (int j = 0; j < 8; ++j) {
      if (nn >= j * 400 && nn < (j + 1) * 400) {
        b = 0;
        if (ch[j] == 0) {
          ch[j] = 1;
          ++ct;
        }
      }
    }
    if (b) ++free;
  }
  cout << ct << " " << min(ct + free, 8) << endl;
  return 0;
}
