#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<malloc.h>

typedef struct node{
char number[20];
struct node *next;
}node,*queueptr;
typedef struct{
queueptr front;
queueptr rear;
}linkque;
void initque(linkque &q)
{
     q.front=q.rear=(queueptr)malloc(sizeof(node));
     q.front->next=NULL;
}
void enque(linkque &q,char *e)
{
     queueptr p;
     p=(queueptr)malloc(sizeof(node));

     strcpy(p->number,e);
     q.rear->next=p;
     p->next=NULL;
     q.rear=p;
}
char * deque(linkque &q,char *e)
{
     queueptr p;
     if(q.front==q.rear)
     exit(0);
     p=q.front->next;
     strcpy(e,p->number);
     q.front->next=p->next;
     if(q.rear==p)
     {
       q.rear=q.front;
     }
     free(p);
     return e;
}
int emptyque(linkque &q)
{
    if(q.front==q.rear)
    return 1;
    else
    return 0;
}
int main()
{
    char e[10];
    linkque q;
    char lin;
    initque(q);
    scanf("%c",&lin);
    getchar();
    while(1)
    {
        if (lin=='a'||lin=='A')
        {
            scanf("%s",e);
            getchar();
            enque(q,e);
        }
        else if(lin=='n'||lin=='N')
        {
            if(emptyque(q))
            {
                printf("无病人就诊\n");

            }
            else
            printf("病历号为%s的病人就诊\n",deque(q,e));

        }
        else if(lin=='s'||lin=='S')
        {
            break;
        }
        else
        printf("输入命令不合法！\n");
        scanf("%c",&lin);
        getchar();
    }
    printf("今天不再接收病人排队，下列排队的病人依次就诊：");
    while(!emptyque(q))
    {
        printf("%s ",deque(q,e));
    }
    return 0;
}