#include "bits/stdc++.h"

using namespace std;

namespace lab{
    template<typename T>
    class Queue{
    public:
        Queue(int size) : length(size), arr(new T[size]), begin(0), count(0), end(-1){ }
        ~Queue(){ delete []arr; }
        void push(int el){
            if(isFull())
                resize(length + length / 10);
            ++end%=length;
            arr[end] = el;
            count++;
        }
        void pop(){
            if(!isEmpty()){
                arr[begin] = INT_MIN;
                ++begin%=length;
                count--;
            } else {
                throw runtime_error("going beyond the boundaries of the array");
            }
        }
        int front(){
            if(!isEmpty())
                return arr[begin];
            else throw runtime_error("going beyond the boundaries of the array");
        }
        void resize(int new_size){
            int *arr2 = arr;
            arr = new int[new_size];
            for(int i = 0; i < length; ++i){
                arr[i] = arr2[(i + begin) % length];
            }
            begin = 0;
            end = length - 1;
            length = new_size;
            delete []arr2;
        }
        bool isEmpty(){ return size() == 0; }
        bool isFull() { return size() == count; }
        int size() { return length; }


        void print(){
            for(int i = begin; i < begin + count; ++i)
                cout << arr[i%length] << ' ';
            cout << endl;
        }

        void countingSort(){
            int mx = INT_MIN;
            for(const auto& it : arr){
                mx = max(mx, it);
            }
            auto count = vector<int>(mx + 1, 0);
            for(int elem : arr)
                ++count[elem];

        }


    private:
        T *arr;
        int length;
        int begin;
        int end;
        int count;
    };
}

#ifndef UNTITLED1_LAB_H
#define UNTITLED1_LAB_H

#endif //UNTITLED1_LAB_H