#include <iostream>
using namespace std;
#define SIZE 5
int queue[SIZE], n = SIZE, front = -1, rear = -1;

bool isfull() {
    return rear == n - 1;
}

void Insert() {
    int val;
    if (isfull())
        cout << "Kolejka przepelniona" << endl;
    else {
        if (front == -1)
            front = 0;
        cout << "Wporawdz element do listy : ";
        cin >> val;
        rear++;
        queue[rear] = val;
    }
}

bool isEmpty() {
    return front == -1 || front > rear;
}

void Delete() {
    if (isEmpty()) {
        cout << "Brak elementow w kolejce" << endl;
        return;
    }
    else {
        cout << "Element usuwany : " << queue[front] << endl;
        front++;;
    }
}

void Display() {
    if (front == -1)
        cout << "Kolejka jest pusta" << endl;
    else {
        cout << "Elementy kolejki : ";
        for (int i = front; i <= rear; i++)
            cout << queue[i] << " ";
        cout << endl;
    }
}

int main() {
    int ch;
    do {
        cout << endl << "1) Wprowadz element do kolejki" << endl;
        cout << "2) Usun element z kolejki" << endl;
        cout << "3) Wyswietl elementy kolejki" << endl;
        cout << "4) Wyjscie" << endl;
        cout << "Wybierz opcje : ";
        cin >> ch;
        switch (ch) {
        case 1: Insert();
            break;
        case 2: Delete();
            break;
        case 3: Display();
            break;
        case 4: cout << "Wyjscie" << endl;
            break;
        default: cout << "Zly wybor" << endl;
        }
    } while (ch != 4);
    return 0;
}