#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>

using namespace std;

#define reps(i,f,n) for(int i=f; i<int(n); ++i)
#define rep(i,n) reps(i,0,n)

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;

int main()
{
	int n;
	while(scanf("%d", &n), n){
		const int age[] = {10, 20, 30, 40, 50, 60};
		int cnt[7] = {0};
		rep(i, n){
			int a;
			scanf("%d", &a);
			cnt[upper_bound(age, age+6, a)-age]++;
		}
		rep(i, 7)
			printf("%d\n", cnt[i]);
	}
	return 0;
}