#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
//#include "libs.h"
#include <random>
#include <unordered_map>
#include <unordered_set>
//#include <opencv2/core.hpp>
//#include <opencv2/highgui.hpp>
//#include <opencv2/imgproc.hpp>

using namespace std;

//呪文
#define DUMPOUT cerr
#define dump(...) DUMPOUT<<"  ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<"    ";dump_func(__VA_ARGS__)

typedef unsigned uint; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; typedef pair<string, string> pss;
template <typename _KTy, typename _Ty> ostream& operator << (ostream& o, const pair<_KTy, _Ty>& m) { o << "{" << m.first << ", " << m.second << "}"; return o; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& o, const map<_KTy, _Ty>& m) { if (m.empty()) { o << "{ }"; return o; } o << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& o, const unordered_map<_KTy, _Ty>& m) { if (m.empty()) { o << "{ }"; return o; } o << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const vector<_Ty>& v) { if (v.empty()) { o << "{ }"; return o; } o << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const set<_Ty>& s) { if (s.empty()) { o << "{ }"; return o; } o << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { o << ", " << *itr; } o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const unordered_set<_Ty>& s) { if (s.empty()) { o << "{ }"; return o; } o << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { o << ", " << *itr; }	o << "}"; return o; }
template <typename _Ty> ostream& operator << (ostream& o, const stack<_Ty>& s) { if (s.empty()) { o << "{ }"; return o; } stack<_Ty> t(s); o << "{" << t.top(); t.pop(); while (!t.empty()) { o << ", " << t.top(); t.pop(); } o << "}";	return o; }
template <typename _Ty> ostream& operator << (ostream& o, const list<_Ty>& l) { if (l.empty()) { o << "{ }"; return o; } o << "{" << l.front(); for (auto itr = ++l.begin(); itr != l.end(); ++itr) { o << ", " << *itr; } o << "}"; return o; }
template <typename _KTy, typename _Ty> istream& operator >> (istream& is, pair<_KTy, _Ty>& m) { is >> m.first >> m.second; return is; }
template <typename _Ty> istream& operator >> (istream& is, vector<_Ty>& v) { for (size_t i = 0; i < v.size(); i++) is >> v[i]; return is; }
namespace aux { // print tuple
	template<typename Ty, unsigned N, unsigned L> struct tp { static void print(ostream& os, const Ty& v) { os << get<N>(v) << ", "; tp<Ty, N + 1, L>::print(os, v); } };
	template<typename Ty, unsigned N> struct tp<Ty, N, N> { static void print(ostream& os, const Ty& v) { os << get<N>(v); } };
}
template<typename... Tys> ostream& operator<<(ostream& os, const tuple<Tys...>& t) { os << "{"; aux::tp<tuple<Tys...>, 0, sizeof...(Tys)-1>::print(os, t); os << "}"; return os; }

template<typename A, size_t N, typename T> inline void Fill(A(&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); }

void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...); }

#define PI 3.14159265358979323846
#define EPS 1e-10
#define FOR(is,a,n) for(int is=(a);is<(n);++is)
#define REP(is,n)  FOR(is,0,n)
#define all(j) (j).begin(), (j).end()
#define SZ(j) ((int)(j).size())
#define fake false



template<typename T> class BinarySearchTree {

	typedef struct Node {
		T key;
		Node *parent, *left, *right;
		Node() {}
		Node(T key, Node* parent, Node* left, Node* right) : key(key), parent(parent), left(left), right(right) {}
	}*NodePtr;

	NodePtr treeMinimum(NodePtr x) {
		while (x->left != NULL)
			x = x->left;
		return x;
	}

	NodePtr treeSuccessor(NodePtr x) {
		if (x->right != NULL)
			return treeMinimum(x->right);
		NodePtr y = x->parent;
		while (y != NULL && x == y->right) {
			x = y;
			y = y->parent;
		}
		return y;
	}

	NodePtr root;

public:
	
	BinarySearchTree() : root(NULL) {}

	void insert(T key) {
		NodePtr z = new Node(key, NULL, NULL, NULL);
		NodePtr y = NULL;
		NodePtr x = root;
		while (x != NULL) {
			y = x;
			if (z->key < x->key)
				x = x->left;
			else
				x = x->right;
		}
		z->parent = y;

		if (y == NULL)
			root = z;
		else {
			if (z->key < y->key)
				y->left = z;
			else
				y->right = z;
		}
	}

	NodePtr find(T key) {
		NodePtr cur = root;
		while (cur != NULL) {
			if (key == cur->key)
				return cur;
			else if (key < cur->key)
				cur = cur->left;
			else
				cur = cur->right;
		}
		return NULL;
	}

	void erase(NodePtr z) {
		NodePtr y;
		NodePtr x;

		if (z->left == NULL || z->right == NULL)
			y = z;
		else
			y = treeSuccessor(z);

		if (y->left != NULL)
			x = y->left;
		else
			x = y->right;

		if (x != NULL)
			x->parent = y->parent;

		if (y->parent == NULL)
			root = x;
		else {
			if (y == y->parent->left)
				y->parent->left = x;
			else
				y->parent->right = x;
		}

		if (y != z)
			z->key = y->key;

		delete y;
	}

	void printInorder(NodePtr node) {
		if (node == NULL)
			return;
		printInorder(node->left);
		cout << " " << node->key;
		printInorder(node->right);
	}

	void printInorder() {
		printInorder(root);
	}

	void printPreorder(NodePtr node) {
		if (node == NULL)
			return;
		cout << " " << node->key;
		printPreorder(node->left);
		printPreorder(node->right);
	}

	void printPreorder() {
		printPreorder(root);
	}

};

int main() {
	
	cin.tie(0);
	ios::sync_with_stdio(false);

	BinarySearchTree<int> bst;

	int n;
	cin >> n;

	REP(i, n) {
		string cmd;
		int key;
		cin >> cmd;
		if (cmd == "print") {
			bst.printInorder();
			cout << endl;
			bst.printPreorder();
			cout << endl;
		}
		else if(cmd == "insert") {
			cin >> key;
			bst.insert(key);
		}
		else if (cmd == "find") {
			cin >> key;
			cout << (bst.find(key) ? "yes" : "no") << endl;
		}
		else if (cmd == "delete") {
			cin >> key;
			bst.erase(bst.find(key));
		}
	}

	return 0;
}



Measured memory_bytes: 21912