#include<iostream>
using namespace std;
#define MAXSIZE 100
#define OK 1
#define ERROR 0
#define OVERFLOW - 2
typedef struct {
int * base;
int front;
int rear;
}
SqQueue;
int InitQueue(SqQueue & Q) { //构造一个空队列Q
Q.base = new int[MAXSIZE]; //为队列分配一个最大容量为MAXSIZE的数组空间
if (!Q.base) return OVERFLOW; //存储分配失败
Q.front = Q.rear = 0; //头尾指针置零，队列为空
return OK;
}
int EnQueue(SqQueue & Q, int e) { //在Q的队头插入新元素e
/**************begin************/
/**************end************/
}
int DeQueue(SqQueue & Q) { //删除Q的队尾元素，用e返回其值
/**************begin************/
/**************end************/
}
int main() {
int n;
while (cin >> n && n != 0) {
SqQueue Q;
InitQueue(Q);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
EnQueue(Q, x);
}
for (int i = 0; i < n - 1; i++)
cout << DeQueue(Q) << " ";
cout << DeQueue(Q) << endl;
}
return 0;
}
