#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; }
int main() {
  int n;
  cin >> n;
  int colors[9] = {0};
  for (int i = 0; i < (n); i++) {
    int a;
    cin >> a;
    if (a / 400 >= 8) {
      colors[8] += 1;
    } else {
      if (colors[a / 400] == 0) {
        colors[a / 400] = 1;
      }
    }
  }
  int count = 0;
  for (int i = 0; i < (8); i++) {
    count += colors[i];
    cout << colors[i] << endl;
  }
  cout << max(count, 1) << " " << count + colors[8] << endl;
  return 0;
}
