#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <stack>
#include <queue>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>

using namespace std;

#define rep(i,n) for(int i=0; i<(n); i++)
#define repc(i,s,e) for(int i=(s); i<(e); i++)
#define pb(n) push_back((n))
#define mp(n,m) make_pair((n),(m))
#define all(r) r.begin(),r.end()
#define fi first
#define se second

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;




int main() {
	int n;
	double d;
	vi v(6, 0);
	double a[5] = { 165.0,170.0,175.0,180.0,185.0 };
	cin >> n;
	rep(i, n) {
		cin >> d;
		for (int i = 0; i < 5; i++) {
			if (d < a[i]) {
				v[i] += 1;
				break;
			}
			if (i == 4)v[5] += 1;
		}
	}
	/*for (int i = 0; i < 6; i++) {
		cout << i << ":" << v[i] << endl;
	}*/
	for (int i = 1; i < 7; i++) {
		cout << i << ":";
		for (int j = 0; j < v[i - 1]; j++) {
			cout << "*";
		}
		cout << endl;
	}
}