import java.io._
import scala.io.StdIn.{readInt, readLine}

object Main {
  val out:BufferedWriter =
    new BufferedWriter(new OutputStreamWriter(new FileOutputStream(FileDescriptor.out), "ASCII"), 512)
  var count = 0
  def printstr(str:String) = {
    out.write(str)
    if(count<500) count += 1
    else { out.flush; count = 0 }
  }

  class Node(var key:Int, var left:Node = null, var right:Node = null, var parent:Node = null) { }

        def getNodeToInsert(node:Node,keyNode:Node):Node = if(node.key > keyNode.key) {
                        if(node.left == null) node
                        else getNodeToInsert(node.left,keyNode)
                } else {
                        if(node.right == null) node
                        else getNodeToInsert(node.right,keyNode)
                }

  def insert(tree:Node, keyNode:Node) = {
    val target = getNodeToInsert(tree,keyNode)
    if(keyNode.key < target.key) target.left = keyNode
    else target.right = keyNode
    keyNode.parent = target
  }

  def inOrder(tree:Node):Unit =
    if(tree == null || tree.key == -1) return
    else {
      inOrder(tree.left)
      printstr(" ")
      printstr(tree.key.toString)
      inOrder(tree.right)
    }

  def preOrder(tree:Node):Unit =
    if(tree == null || tree.key == -1) return
    else {
      printstr(" ")
      printstr(tree.key.toString)
      preOrder(tree.left)
      preOrder(tree.right)
    }

  def find(tree:Node, key:Int):Node = {
          def loop(node:Node):Node = {
      if(node == null || node.key == -1) {
        null
      } else if(node.key > key) {
        loop(node.left)
      } else if(node.key < key) {
        loop(node.right)
      } else {
        node
      }
    }

    loop(tree)
  }

  def delete(tree:Node, key:Int):Unit = {
    val node = find(tree, key)
    if(node!=null) {
      val parent = node.parent
      if(node.left == null && node.right == null) {
        if(parent == null) { tree.key = -1; tree.right = null; tree.left = null }
        else if(parent.left == node) parent.left = null
        else if(node.parent.right == node) parent.right = null
      } else if(node.left != null && node.right == null) {
        if(parent == null) { tree.key = node.key; tree.right = null; tree.left = node.left;node.left.parent = null }
        else if(parent.left == node) { parent.left = node.left; node.left.parent = parent }
        else if(node.parent.right == node) { parent.right = node.left; node.left.parent = parent }
      } else if(node.right != null && node.left == null) {
        if(parent == null) { tree.key = node.key; tree.left = null; tree.right = node.right; node.right.parent = null }
        else if(parent.left == node) { parent.left = node.right; node.right.parent = parent }
        else if(parent.right == node) { parent.right = node.right; node.right.parent = parent }
      } else {
        node.key = node.left.key
        delete(node.left, node.left.key)
      }
    }
  }

  def main(args:Array[String]) = {
    val n = readInt
    val tree = new Node(-1)

    for(i<-0 until n) {
      val s = readLine.split(" ")
      s(0) match {
        case "insert" =>
          if(tree.key == -1) tree.key = s(1).toInt
          else insert(tree, new Node(s(1).toInt))
        case "find" => {
          val node = find(tree, s(1).toInt)
          if(node!=null) printstr("yes\n") else printstr("no\n")
        }
        case "delete" => {
          delete(tree, s(1).toInt)
        }
        case _ => {
          inOrder(tree)
          printstr("\n")
          preOrder(tree)
          printstr("\n")
        }
      }
    }
    out.flush
    out.close
  }
}