#include<stdio.h>
#include<string.h>
int stack[1000];
int top=-1;
int size;
void push(int x){
    if(top>=size-1){
        return;
    }
    stack[++top]=x;
}
int pop(){
    if(top<0){
        return -1;
    }
    return stack[top-1];
}
void sortStack(){
    if(top<1){
        return;
    }
    int temp;
    for(int i=0;i<=top;i++){
        for(int j=i+1;j<=top;j++){
            if(stack[i]>stack[j]){
                temp=stack[i];
                stack[i]=stack[j];
                stack[j]=temp;
            }
        }
    }
}
void printStack(){
    for(int i=0;i<=top;i++){
        printf("%d",stack[i]);
    }
    printf("\n");
}
int main(){
    scanf('%d',&size);
    char operation[10];
    int value;
    while(scanf("%s",operation)!=EOF){
        if(strcmp(operation,"push")==0){
            scanf("%d",&value);
            push(value);
        }else if(strcmp(operation,"sort")==0){
            sortStack();
            printStack();
        }
        return 0;
}