#include
using namespace std;
#define max 6
int q[max];
int r = -1,f = 0;
void enqueue()
{
int item;
if(r == max-1)
{
cout<<"queue is full."<>item;
q[++r] = item;
}
}
void dequeue()
{
int item;
if(r>ch;
switch(ch)
{
case 1 :
{
enqueue();
break;
}
case 2 :
{
dequeue();
break;
}
case 3 :
{
display();
break;
}
case 4 :
{
exit(1);
break;
}
}
}
return 0;
}