Program to delete an element in a linear queue | Data Structures Tutorial pdf

DELETION-Deletion means removing element from queue.deletion is performed on the front end of queue.
/*Program to delete an element in a linear queue*/
#include<stdio.h>
#include<conio.h>
#include<process.h>
int que[10],i,max,n,item,front=-1, rear=-1;
void main()
{
clrscr();
printf("Enter size of queue:");
scanf("%d", &n);
if(n==0)
{
printf("Queue is empty. Nothing to delete. Underflow!!!");
getch();
exit(0);
}
if(n>10)
{
printf("Entered value exceed the limit of queue...");
getch();
exit(0);
}
printf("\n Enter elements of queue....");
for(i=0;i<=n-1;i++)
{
scanf("%d",&que[i]);
front=0;
rear = rear+1;
}
if(front == -1)
{
printf("\nQueue is Empty. Nothing full. Overflow!!!");
getch();
exit(0);
}
else
{
item=que[front];
front=front+1;
printf("\n%d is deleted from Front...",item);
}
printf("\n\n Queue AFTER deletion is...");
for(i=front;i<=rear;i++)
printf("\t%d",que[i]);
getch();
}