#include<stdio.h>
#define Max_Size 3
int queue[Max_Size];
int front=0,back=-1;
int size()
{
return back-front+1;
}
int empty()
{
return size()==0;
}
void push(int x)
{
if(back<Max_Size-1)
{
queue[++back]=x;
}
else
{
printf("ovrr\n");
}
}
void pop()
{
if(size()==0)
{
printf("u\n");
}
else
{
front++;
}
}
int front_element()
{
if(!empty())
{
return queue[front];
}
else
{
printf("em\n");
return -1;
}
}
int back_element()
{
if(!empty())
{
return queue[back];
}
else
{
printf("em\n");
return -1;
}
}
int main()
{
push(9);
printf("%d\n",front_element());
pop();
printf("%d\n",size());
return 0;
}