import java.util.List;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

class Node {
    int id;
    Node parent;
    Node left;
    Node right;
}

class Main {
    static Node root;
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        for (int i = 0; i < n; i++) {
            String command = sc.next();
            if (command.charAt(0) == 'i') {
                int id = sc.nextInt();
                insert(id);
            } else if (command.charAt(0) == 'p') {
                System.out.println(inParse(root));
                System.out.println(preParse(root));
            } else if (command.charAt(0) == 'f') {
                int id = sc.nextInt();
                System.out.println(find(id) != null ? "yes" : "no");
            } else if (command.charAt(0) == 'd') {
                int id = sc.nextInt();
                delete(find(id));
            }
        }
    }

    public static void insert(int id) {
        Node insertedNode = new Node();
        insertedNode.id = id;

        if (root == null) {
            root = insertedNode;
            return;
        }

        Node node = root;
        while(true) {
            if (id < node.id) {
                if (node.left == null) {
                    node.left = insertedNode;
                    insertedNode.parent = node;
                    return;
                }
                node = node.left;
            } else {
                if (node.right == null) {
                    node.right = insertedNode;
                    insertedNode.parent = node;
                    return;
                }
                node = node.right;
            }
        }
    }

    public static Node find(int id) {
        Node node = root;
        while(true) {
            if (node == null) {
                return null;
            } else if (id == node.id) {
                return node;
            }

            if (id < node.id) {
                node = node.left;
            } else {
                node = node.right;
            }
        }
    }

    public static void delete(Node node) {
        if (node.left != null && node.right != null) {
            Node anode = node.right;

            if (anode.left == null) {
                anode.parent.right = null;
            } else {
                while (anode.left != null) {
                    anode = anode.left;
                }
                anode.parent.left = null;
            }
            node.id = anode.id;
            anode.parent = null;
            return;
        }

        if (node.left == null && node.right == null) {
            if (node.parent == null) {
                root = null;
                return;
            }
            if (node.parent.right == node) {
                node.parent.right = null;
            } else {
              node.parent.left = null;
            }
            node.parent = null;
            return;
        }

        if (node.left != null) {
            if (node.parent.right == node) {
                node.parent.right = node.left;
            } else {
                node.parent.left = node.left;
            }
            node.left.parent = node.parent;
            node.parent = null;
            node.left = null;
            return;
        }

        if (node.right != null) {
            if (node.parent.right == node) {
                node.parent.right = node.right;
            } else {
                node.parent.left = node.right;
            }
            node.right.parent = node.parent;
            node.parent = null;
            node.right = null;
            return;
        }
    }

    public static String preParse(Node node) {
        if (node == null) {
            return "";
        }
        return " " + node.id + preParse(node.left) + preParse(node.right);
    }

    public static String inParse(Node node) {
        if (node == null) {
            return "";
        }
        return inParse(node.left) + " " + node.id + inParse(node.right);
    }
}



Measured memory_bytes: 455824