#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
	const size_t SCREEN_WIDTH = 80;
	const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;

		size_t number_count;
		cerr << "Enter number_count ";
		cin >> number_count;
		vector<double> numbers(number_count);
		cerr << "Enter numbers ";
		for (int i = 0; i < number_count;i++) {
			cin >> numbers[i];

		}
		size_t bin_count;
		cerr << "Enter bin count ";
		cin >> bin_count;

		vector<size_t> bins(bin_count);
		double max = numbers[0];
		double min = numbers[0];
		for (int i = 0; i < number_count;i++) {
			if (numbers[i] > max)
				max = numbers[i];
			if (numbers[i] < min)
				min = numbers[i];
		}

		double bin_size = ((max - min) / 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]++;
			}
		}
		size_t maxb = 0;
		for (int i = 0;i < bin_count;i++) {
			if (bins[i] > maxb) {
				maxb = bins[i];

			}

		}
		double k = double(MAX_ASTERISK) / maxb;
		if (k > 1) {
			k = 1;

		}
		vector<size_t> bin_graph(bin_count);
		for (size_t bin = 0; bin < bin_count; bin++) {
			bin_graph[bin] = int(double(bins[bin] * k));

		}
		for (size_t i = 0; i < bin_count; i++) {
			if (bins[i] < 100) {
				cout << " ";
			}
			if (bins[i] < 10) {
				cout << " ";
			}
			cout << bins[i] << '|';
			for (size_t j = 0;j < bin_graph[i];j++) {
				cout << "*";

			}
			cout << endl;

		}


	return 0;
}