#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <cstring>
#include <deque>
#include <cstdio>
#include <cmath>

using namespace std;

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

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

int main()
{
	int n;
	scanf("%d", &n);
	
	int hist[6] = {0};
	rep(i, n){
		double h;
		scanf("%lf", &h);
		
		const double harr[] = {165.0, 170.0, 175.0, 180.0, 185.0};
		int term = 0;
		rep(i, 5)
			term += harr[i] <= h;
		hist[term]++;
	}
	
	rep(i, 6){
		printf("%d:", i+1);
		rep(j, hist[i])
			putchar('*');
		puts("");
	}
	
	return 0;
}