FIFO with Array - HU

#include <iostream>
#define NMAX 5
using namespace std;

int sor[NMAX],n,i;

void kiiratas(){
    if (n == -1){
        cout << "\nA sor ures!" << endl;
    }else{
        cout << "\nA sor elemei:" << endl;
        for(int j=n; j<=i; j++){
            cout << sor[j] << endl;
        }
    }
}

void elemHozzadasa(){
    int elem;

    if(i == NMAX - 1){
        cout << "\nA sor tele van!" << endl;
    }else{
        cout << "\nAdj hozza egy elemet a sorhoz: " << endl;
        cin >> elem;
        i++;

        sor[i] = elem;

        if(n == - 1){
            n = 0;
        }
    }
}

void elemTorlese(){
    int elem;
    if(n == -1){
        cout << "\nNincs mit kitorolni. A sor ures!" << endl;
    }else{
        elem = sor[n];
        cout << "\n" << elem <<" ki lett torolve a sorbol." << endl;
    }

    if (n == i){
        n = i = -1;
    }else{
        n++;
    }
}

int main()
{
n = i = -1;

while(true){
    cout << "1. Kiiratas" << endl;
    cout << "2. Elem hozzaadasa" << endl;
    cout << "3. Elem torlese" << endl;
    cout << "4. Kilepes" << endl;

    cout << "\nMit szeretnel? " << endl;
    int valasz;
    cin >> valasz;

    switch(valasz){
        case 1: kiiratas(); break;
        case 2: elemHozzadasa(); break;
        case 3: elemTorlese(); break;
        case 4: return 0; break;
        default: cout << "Nincs ilyen lehetőség!" << endl; break;
    }

    cout << endl;
    cout << "-------------------------------------" << endl;
    cout << endl;
}
}