#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
using namespace std;

#define rep(i,n) for(int (i)=0; (i)<(int)(n); ++(i))
#define foreach(c,i) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)

int n;
const int ar[7] = { 9, 19, 29, 39, 49, 59, 1<<30 };

void solve() {
  int ans[7], temp;
  rep (i,7) ans[i] = 0;
  rep (i,n) {
    cin >> temp;
    int v = lower_bound(ar, ar + 7, temp) - ar;
    ans[v]++;
  }
  rep (i,7) cout << ans[i] << endl;
}

int main() {
  while (cin >> n, n) {
    solve();
  }
  return 0;
}