#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;

int main() {
	int n;
	vector<double>v;
	vector<char>a, b, c, d, e, f;
	double ba;
	int ca=0, cb=0, cc=0, cd=0, ce=0, cf=0;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin>>ba;
		v.push_back(ba);
	}
	sort(v.begin(), v.end());
	for (int i = 0; i < n; i++) {
		if (v[i] < 165) { ca++; }
		else if (v[i] >= 165 && v[i] < 170) { cb++; }
		else if (170 <= v[i] && v[i] < 175) { cc++; }
		else if (175 <= v[i] && v[i] < 180) { cd++; }
		else if (180 <= v[i] && v[i] < 185) { ce++; }
		else { cf++; }
	}
	cout << "1:";
	for (int i = 0; i < ca; i++) {
		a.push_back('*');
		cout << a[i];
	}
	cout << '\n'<<"2:";
	for (int i = 0; i < cb; i++) {
		b.push_back('*');
		cout << b[i];
	}
	cout << '\n' << "3:";
	for (int i = 0; i < cc; i++) {
		c.push_back('*');
		cout << c[i];
	}
	cout << '\n' << "4:";
	for (int i = 0; i < cd; i++) {
		d.push_back('*');
		cout << d[i];
	}
	cout << '\n' << "5:";
	for (int i = 0; i < ce; i++) {
		e.push_back('*');
		cout << e[i];
	}
	cout << '\n' << "6:";
	for (int i = 0; i < cf; i++) {
		f.push_back('*');
		cout << f[i];
	}
	cout << endl;

	return 0;
}