#include <iostream>
#include <vector>
using namespace std;

struct Input {
    vector<double> numbers;
    size_t bin_count{};
};
Input
input_data(){
    Input in;
size_t number_count;
cin >> number_count;
in.numbers.resize(number_count);
    for (size_t i = 0; i < number_count; i++) {
        cin >> in.numbers[i];
    }
cin >> in.bin_count;
return in;
}
    void find_minmax(vector<double> numbers, double min, double max) {
    min = numbers[0];
    max = numbers[0];
    for (double x : numbers) {
    if (x < min) {
        min = x;
    }
    else if (x > max) {
        max = x;
    }
}
}


int main()
{   Input in = input_data();
    double bin_size = (max - min) / bin_count;
        vector<size_t> bins(bin_count);
    for (size_t i = 0; i < number_count; i++) {
        bool found = false;
    for (size_t j = 0; (j < bin_count - 1) && !found; j++) {
        auto lo = min + j * bin_size;
        auto hi = min + (j + 1) * bin_size;
        if ((lo <= numbers[i]) && (numbers[i] < hi)) {
            bins[j]++;
            found = true;
        }
    }
    if (!found)
        bins[bin_count-1]++;
    }
    for(size_t i=0;i<bin_count;i++){
        cout<<bins[i]<<"|";
        for(size_t j=0;j<=i;j++)
            cout<<"*";
        cout<<endl;}
}