#define _USE_MATH_DEFINES
#include <iostream>
#include <complex>
#include <algorithm>
#include <vector>
#include <stack>
#include <string>
#include <queue>
#include <cmath>
#include <math.h>
#include <numeric>
#include <list>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <climits>
#include <set>
#include <memory.h>
#include <memory>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cassert>
#include <map>
#include <cassert>
#include <time.h>
#include <ctime>

using namespace std;

typedef complex<double> xy_t;
typedef pair<xy_t, xy_t> line;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int , P> PP;
typedef pair<int, string> Ps;
typedef vector<int> vec;
typedef vector<vec> mat;
const int INF = 1 << 30;
const double EPS = 1e-9;
const double PI = 3.1415926535897932384626433832795;
const int CLK = CLOCKS_PER_SEC;

#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, m, n) for(int i = m; i < n; i++)

int nums[7];
int main(){
	int n, num;
	while(cin >> n && n){
		fill(nums, nums + 7, 0);
		rep(i, n){
			cin >> num;
			if(num < 10) nums[0]++;
			else if(num < 20) nums[1]++;
			else if(num < 30) nums[2]++;
			else if(num < 40) nums[3]++;
			else if(num < 50) nums[4]++;
			else if(num < 60) nums[5]++;
			else nums[6]++;
		}
		rep(i, 7) cout << nums[i] << endl;
	}
	return 0;
}