#include
#include
#define LIST_SIZE 5
using namespace std;
class LX{
private:
int key;
public:
LX(int key){this->key=key;}
int getkey(){return key;}
LX(){this->key=key;}
void set_key(int key){this->key=key;}
};
class Queue{
private:
LX *listarray;
int size;
int rear;
int front;
public:
Queue(int sz=LIST_SIZE){
size=sz+1;
listarray=new LX;
rear=front=0;
}
~Queue(){delete []listarray;}
void clear(){front=rear;}
bool isEmpty(){return rear==front;}
bool isFull(){return(front==(rear+1)%size);}
LX First(){
if(!isEmpty())
return listarray[(front+1)%size];
else
cout