#include<stdio.h>
#define SIZE 100
int queue[SIZE];
int front=0;
int rear=0;

void enQueue(int data){
printf("enQueue> front= %d rear= %d\n",front,rear);
if(rear>=SIZE)return;
queue[rear]=data;
rear++;
}

int deQueue(void){
printf("deQueue> front= %d rear= %d\n",front,rear);
if(front==rear){
printf("deQueue> queue empty\n");
return-1;
}
return queue[front++];
}

void printQueue(void){
int i=0;
printf("printQueue> ");
for(i=front;i<rear;i++)printf("%d ",queue[i]);
printf("\n");
}

int main(void){
enQueue(1);
enQueue(2);
enQueue(3);
printQueue();
printf("deQueue: %d\n",deQueue());
printf("deQueue: %d\n",deQueue());
printf("deQueue: %d\n",deQueue());
printf("deQueue: %d\n",deQueue());
return 0;
}