#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <utility>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <queue>
#include <map>
using namespace std;
typedef long long ll;
const int INF = 1<<30; 
const int MOD = 1e9 + 7;
const int dy[] = {1, 0, -1, 0};
const int dx[] = {0, 1, 0, -1};
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    vector<int> cnt(6, 0);
    for(int i = 0; i < n; i++)
    {
        double h; cin >> h;
        if(h >= 185) cnt[5]++;
        else if(h >= 180) cnt[4]++;
        else if(h >= 175) cnt[3]++;
        else if(h >= 170) cnt[2]++;
        else if(h >= 165) cnt[1]++;
        else cnt[0]++;
    }
    for(int i = 0; i < 6; i++)
    {
        cout << i + 1 << ":";
        for(int j = 0; j < cnt[i]; j++)
        {
            cout << "*";
        }
        cout << endl;
    }
    return 0;
}
