#include <iostream>
#include<bits/stdc++.h>
using namespace std;
typedef struct bstnode{
int data;
struct bstnode *lchild,*rchild;
}bstnode,*bstree;
void insertbst(bstree &mytree,int x){
if(mytree==NULL){
mytree=new bstnode;
mytree->data=x;
mytree->lchild=NULL;
mytree->rchild=NULL;
}else if(x<mytree->data){
insertbst(mytree->lchild,x);
}else if(x>mytree->data){
insertbst(mytree->rchild,x);
}
}
void creatbst(bstree &mytree){
mytree=NULL;
int x;
cin>>x;
while(x!=0){
insertbst(mytree,x);
cin>>x;
}
}
void visit(bstree mytree){
if(mytree){
visit(mytree->lchild);
cout<<mytree->data<<" ";
visit(mytree->rchild);
}
}
void delet(bstree &mytree,int key){
bstree p,f,s,q;
p=mytree;f=NULL;
if(!p) {
cout<<"kongshu"<<endl;exit(0);}
while(p){
if(p->data==key) break;
f=p;
if(p->data<key) p=p->rchild;
else p=p->lchild;
}
if(!p){
cout<<"wu node"<<endl;exit(0);}
q=p;
if(p->lchild&&p->rchild){
s=q->lchild;
while(s->rchild!=NULL){
q=s;
s=s->rchild;
}
p->data=s->data;
if(q!=p)q->rchild=s->lchild;
else p->lchild=s->lchild;
free(s);
return;
}else if(!p->lchild){
p=p->rchild;
}else if(!p->rchild){
p=p->lchild;
}
if(f->lchild==q) f->lchild=p;
else f->rchild=p;
free(q);
}
int main()
{
int x;
bstree mytree;
creatbst(mytree);
cin>>x;
visit(mytree);
delet(mytree,x);
cout<<endl;
visit(mytree);
return 0;
}