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

const size_t SCREEN_WIDTH = 80;
const size_t MAX_ASTERISK = SCREEN_WIDTH - 3 - 1;

struct Input {
    vector<double> numbers;
    size_t bin_count{};
};

Input
input_data(){
    size_t number_count;
    cerr << "Enter number_count: ";
    cin >> number_count;

    Input in;
    in.numbers.resize(number_count);
    cerr << "Enter numbers: ";
    for (size_t i = 0; i < number_count; i++) {
        cin >> in.numbers[i];
    }

    cerr << "Enter bin count: ";
    cin >> in.bin_count;

    return in;

}

void
find_minmax(const 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();

    //size_t i, bin;
    double min, max;
    find_minmax(in.numbers, min, max);

   // vector<size_t> bins(bin_count);
    //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 height = 0;
    size_t max_count = 0;
    for (i = 0; i < bin_count; i++){
        if (bins[i] > max_count) max_count = bins[i];
    }

    for(size_t bin:bins){
        size_t height = bin;
        height = MAX_ASTERISK * (static_cast<double>(bin) / max_count);
        for(size_t i = 0; i < height; i++){
            cout<<"*";
        }
        cout<<"|";
        if(bin<100) cout<<" ";
        if(bin<10) cout<<" ";
        cout<<bin<<endl;
    }*/
    return 0;
}