#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>

#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define repi(i,a,b) for(int i = (a); i < (b); i++)

using namespace std;

typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;

const int INF=1<<29;
const double EPS=1e-9;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
double h[10]={165.0,170.0,175.0,180.0,185.0};
int main(){
	int n;
	double a;
	map<int,int> data;
	cin>>n;
	rep(i, n){
		cin>>a;
		if(a<h[0]){
			data[1]++;
		}else if(a >=h[0]&&a <h[1]){
			data[2]++;
		}else if(a >=h[1]&&a <h[2]){
			data[3]++;
		}else if(a >=h[2]&&a <h[3]){
			data[4]++;
		}else if(a >=h[3]&&a <h[4]){
			data[5]++;
		}else if(a>=h[4]){
			data[6]++;
		}
	}
	repi(i, 1, 7){
		cout <<i<<":";
		rep(j,data[i])cout <<"*";
		cout <<endl;
	}
	return 0;
}