#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    int n;
    cin >> n;
    vector<int> cnt(6);
    vector<double> a{165, 170, 175, 180, 185, 9999};
    for (int i = 0; i < n; ++i) {
        double x;
        cin >> x;
        for (int j = 0; j < 6; ++j) {
            if(x < a[j]){
                cnt[j]++;
                break;
            }
        }
    }
    for (int i = 0; i < 6; ++i) {
        cout << i+1 << ":" << string(cnt[i], '*') << "\n";
    }
    return 0;
}
