#AOJ ALDS1_8_B
#binary_search_tree 2

class FindMixin
  def find(n)
    # printf("find %d:[%d][%d]\n",n,self.key,(n == self.key)?1:0)
    if n == self.key
      return 1
    end
    ret = 0
    if self.left != nil && self.key > n 
      return self.left.find(n)
    end
    if self.right != nil && self.key < n 
      return self.right.find(n)
    end
  end
end

class Node < FindMixin
  attr_accessor :key,:parent,:left,:right

  def initialize(n)
    @key    = n
    @parent = nil
    @left   = nil
    @right  = nil
  end

  def add_left(child)
      self.left    = child
      child.parent = self
  end

  def add_right(child)
      self.right    = child
      child.parent = self
  end

  def preorder
    printf(" %d",self.key)
    if(left != nil)
      left.preorder
    end
    if(right!= nil)
      right.preorder
    end
  end

  def inorder
    if(left != nil)
      left.inorder
    end
    printf(" %d",self.key)
    if(right!= nil)
      right.inorder
    end
  end

  def postorder
    if(left != nil)
      left.postorder
    end
    if(right!= nil)
      right.postorder
    end
    printf(" %d",self.key)
  end

end

class Bin_search_tree
  attr_accessor :root

  def initialize
    @root = nil
  end

  def inorder
    self.root.inorder
  end

  def preorder
    self.root.preorder
  end

  def insert(node)
    y = nil
    x = self.root
    while x != nil
      y = x
      if node.key < x.key
        x = x.left
      else
        x = x.right
      end
    end
    
    node.parent = y

    if y == nil
      self.root = node
    elsif node.key < y.key
      y.left = node
    else
      y.right= node
    end
  end

  def find(n)

    self.root.find(n)
  end
end

$n = STDIN.gets.split[0].to_i
$b_s_tree = Bin_search_tree.new

0.upto($n-1){|i|
  s = STDIN.gets.split
  if s[0].to_s == "insert"
    node = Node.new(s[1].to_i)
    $b_s_tree.insert(node)
  elsif s[0].to_s == "print"
    $b_s_tree.inorder
    printf("\n")
    $b_s_tree.preorder
    printf("\n")
  elsif s[0].to_s == "find"
    ky = s[1].to_i
    if 1==$b_s_tree.find(ky)
      puts "yes"
    else
      puts "no"
    end
  end
}