#include <stdio.h>
#include <stdlib.h>
#define MAX 1000
int queue[MAX],qsize = 0;
int templist[MAX],tsize = 0;
int lastProcessed = -1;
void enqueue (int x) {
    queue[qsize++]=x;
}
void sort(int arr[],int n) {
    for (int i=0;i<n-1;i++){
        for (int j=1+1;j<n;j++){
            int temp=arr[i];
            arr[i]=arr[j];
            arr[j]=temp;
        }
    }
}
}
void processNext (){
    if(qsize ==0)
    printf("0\n");
    return 0;
}
sort (queue,qsize);
int found =0;
fof (int i=0;i<qsize++){
    if (lastprocessed == -1 || queue [i] >= lastProcessed){
        lastProcessed = queue [i];
        printf("%d\n",queue[i]);
        for (int j=i; j<qsize-1;j++){
            queue [j] = queue[j+1];
        }
        qsize--;
        found =1;
        break;
    }
}
if (!found){
    for (int i=0;i<qsize;i++){
        templist[tsize++] = queue[i];
    }
    qsize = 0;
    print\f("0\n");
}
}
void printloads(){
    if (qsize == 0&& tsize == 0){
        printf("0\n");
    }
    int all[MAX*2],n=0;
    for (int i=0;i<qsize;i++) all [n+1]=queue[i];
    for (int i=0; i<tsize;i++) all [n+1] = tem
}