using System;
using System.Text;

namespace ALDS1_8_C
{
    class Program
    {
        static Node root;
        static StringBuilder sb = new StringBuilder();

        class Node
        {
            public int key;
            public Node left, right, parent;
            public Node(int key) { this.key = key; }
        }
        
        static Node getmimum(Node x)
        {
            while (x.left != null)
            {
                x = x.left;
            }
            return x;
        }

        static void Main(string[] args)
        {
            int m = int.Parse(Console.ReadLine());
      
            for (int i = 0; i < m; i++)
            {
                var a = Console.ReadLine().Split(' ');
                if (a[0] == "insert")
                {
                    insert(int.Parse(a[1]));
                }
                else if (a[0] == "print")
                {
                    inorder(root);
                    sb.AppendLine();
                    preorder(root);
                    sb.AppendLine();
                }
                else if (a[0] == "find")
                {
                    Node n =find(root, int.Parse(a[1]));
                    sb.AppendLine(n!=null ? "yes" : "no");
                }
                else if(a[0] == "delete")
                {
                    delete(find(root, int.Parse(a[1])));
                }
            }
            Console.Write(sb);
        }
        static void delete(Node z)
        {
            //????????????????±??????????y??¨??????
            Node x, y;
            //??????0???1?????¨????????\????????????z
            if (z.left == null || z.right == null) y = z;
            //??????2?????¨???????¬???????y????????????z????????????????????¢
            else y = getsuccessor(z);

            //y??????x????±???????
            if (y.left != null) x = y.left;
            else x = y.right;

            //x??????????¨??????????
            if (x != null) x.parent = y.parent;

            //y???????????????x?????¨????????¨??????
            if (y.parent == null) root = x;
            //??????????????????????????????????????????x
            else if (y == y.parent.left) y.parent.left = x;
            //??????????????????????????????????????????x
            else y.parent.right = x;

            if (y!=z) z.key = y.key;
            
        }
        static Node getsuccessor(Node x)
        {
            if (x.right != null) return getmimum(x.right);

            Node y = x.parent;
            while (y != null && x == y.right)
            {
                x = y;
                y = y.parent;
            }
            return y;

        }
        static Node find(Node u, int k)
        {
            while (u != null && k != u.key)
            {
                u = k < u.key ? u.left : u.right;
            }
            return u;
        }
        static void insert(int k)
        {
            Node x = root;
            Node y = null;
            Node z = new Node(k);

            while (x != null)
            {
                y = x;
                x = z.key < x.key ? x.left : x.right;
            }

            z.parent = y;

            if (y != null)
            {
                if (z.key < y.key) y.left = z;
                else y.right = z;
            }
            else root = z;

        }   
        static void inorder(Node u)
        {
            if (u == null)
            {
                return;
            } 
            inorder(u.left);
            sb.Append(" " + u.key);
            inorder(u.right);
        }
        static void preorder(Node u)
        {
            if (u == null)
            { 
                return;
            }
            sb.Append(" " + u.key);
            preorder(u.left);
            preorder(u.right);
        }
    }
}

Measured memory_bytes: 91528