#include<stdio.h>
#include<stdlib.h>
int size=10,top=-1;
int arr[10];
int isfull(){
    if(top==size-1)
    return 1;
    else
    return 0;
}
void enqueue(int num){
    if(isfull())
    printf("full");
    else
    arr[++top]=num;
}
int isempty(){
    if(top==-1)
    return 1;
    else
    return 0;
}
void dequeue(){
    if(isempty())
    printf("empty");
    else
    printf("%d\n",arr[0]);
    for(int i=0;i<top;i++){
        arr[i]=arr[i+1];
    }
    top--;
}
void traverse(){
    for(int i=0;i<=top;i++){
        if(arr[i]<=0){
            printf("%d ",arr[i]);
        }
    }
    for(int i=0;i<=top;i++){
        if(arr[i]>0){
            printf("%d ",arr[i]);
        }
    }
}
int main(){
    int i,num;
    scanf("%d",&size);
    if(n<=0){
        printf("Invalid input");
        return 0;
    }
    for(i=1;i<=size;i++){
        scanf("%d",&num);
        enqueue(num);
    }
    traverse();
    return 0;
}