#include <stdio.h>
#include <string.h>

typedef struct tnode tnode;

typedef struct{
	tnode *root;
}Tree;

struct tnode {
	int key;
	tnode *left, *right;
	tnode *p;
};

void insert(Tree *, int);
int  find(Tree *, int);
void delete(Tree *, int);
void print_inorder(Tree *);
void print_preorder(Tree *);
void print_postorder(Tree *);

void insert(Tree *T, int n) {
	tnode *z;
	z = malloc(sizeof(tnode));
	z->key = n;
	z->left = z->right = NULL;
	tnode *y = NULL;
	tnode *x = T->root;
	while (x != NULL) {
		y = x;
		if (z->key < x->key) {
			x = x->left;
		}
		else {
			x = x->right;
		}
		z->p = y;
	}
	if (y == NULL) {
		T->root = z;
	}
	else if (z->key < y->key) {
		y->left = z;
	}
	else {
		y->right = z;
	}
}

int delete_rec(tnode *node, int key) {
	if (node->key == key) {
		if (node->left == NULL && node->right == NULL) {
			if (node->p->key > key) node->p->left = NULL;
			else if (node->p->key <= key) node->p->right = NULL;
		}
		else if (node->left == NULL) {
			if (node->p->key > key) {
				node->right->p = node->p;
				node->p->left = node->right;
			}
			else if (node->p->key <= key) {
				node->right->p = node->p;
				node->p->right = node->right;
			}
		}
		else if (node->right == NULL) {
			if (node->p->key > key) {
				node->left->p = node->p;
				node->p->left = node->left;
			}
			else if (node->p->key <= key) {
				node->left->p = node->p;
				node->p->right = node->left;
			}
		}
		else {
			tnode *crawl = node->right;
			while(crawl->left != NULL) crawl = crawl->left;
			node->key = crawl->key;
			delete_rec(node->right, crawl->key);
		}
		return 4;
	}
	if (node->key > key && node->left != NULL && delete_rec(node->left, key)) return 4;
	if (node->key < key && node->right != NULL && delete_rec(node->right, key)) return 4;
	return 0;
}

void delete(Tree *tree, int key) {
	delete_rec(tree->root, key);
}

int find_rec(tnode *node, int key) {
	if(node->key == key) return 1;
	if(node->key > key) {
		if(node->left != NULL && find_rec(node->left, key)) return 1;
	}
	else {
		if(node->right != NULL && find_rec(node->right, key)) return 1;
	}
	return 0;
}

int find(Tree *tree, int key) {
	return find_rec(tree->root, key);
}

void print_preorder_rec(tnode *node){
	printf(" %d", node->key);
	if(node->left != NULL) print_preorder_rec(node->left);
	if(node->right != NULL) print_preorder_rec(node->right);
}

void print_preorder(Tree *tree) {
	print_preorder_rec(tree->root);
	printf("\n");
}

void print_inorder_rec(tnode *node){
	if(node->left != NULL) print_inorder_rec(node->left);
	printf(" %d", node->key);
	if(node->right != NULL) print_inorder_rec(node->right);
}

void print_inorder(Tree *tree) {
	print_inorder_rec(tree->root);
	printf("\n");
}

void print_postorder_rec(tnode *node){
	if(node->left != NULL) print_postorder_rec(node->left);
	if(node->right != NULL) print_postorder_rec(node->right);
	printf(" %d", node->key);
}

void print_postorder(Tree *tree) {
	print_postorder_rec(tree->root);
	printf("\n");
}

int main(void) {
	Tree T;
	T.root = NULL;
	int i, n, z;
	char command[7];
	scanf("%d", &n);
	for (i = 0; i < n; i++) {
		scanf("%s", command);
		if (strcmp(command, "insert") == 0) {
			scanf("%d", &z);
			insert(&T, z);
		}
		else if (strcmp(command, "delete") == 0) {
			scanf("%d", &z);
			delete(&T, z);
		}
		else if (strcmp(command, "print") == 0) {
			print_inorder(&T);
			print_preorder(&T);
		}
		else if (strcmp(command, "find") == 0) {
			scanf("%d", &z);
			if (find(&T, z)) printf("yes\n");
			else printf("no\n");
		}
	}
	return 0;
}

Measured memory_bytes: 19364