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

struct node {
	int data;
	struct node *next;
};

int main(){
	struct node *head, *p, *q, *t;
	int i, n, a;
	scanf("%d", &n);
	head = NULL;
	for(i = 1;i <= n;i ++){
		scanf("%d", &a);
		p = (struct node*)malloc(sizeof(struct node));
		p -> data = a;
		p -> next = NULL;
		if(head == NULL){
			head = p;
		}
		else{
			q -> next = p;
		}

		q = p;
	}

	scanf("%d", &a);
	t = head;
        while(t != NULL){
		if(t -> next == NULL || t -> next -> data > a){
			p = (struct node*)malloc(sizeof(struct node*));
			p -> data = a;
			p -> next = t -> next;
			t -> next = p;
		break;
		}
		else{
			t = t -> next;
		}
	}
	t = head;
	while(t != NULL){
		printf("%d ", t -> data);
		t = t -> next;
	}
	printf("\n");
	return 0;
}