class Tree
  def initialize(key)
    @key = key
    @left = nil
    @right = nil
  end

  def insert(k)
    if @key > k
      if !@left
        @left = Tree.new(k)
      else
        @left.insert(k)
      end
    else
      if !@right
        @right = Tree.new(k)
      else
        @right.insert(k)
      end
    end
  end

  def inorder(list)
    if @left
      list = @left.inorder(list)
    end

    list.push(@key)

    if @right
      list = @right.inorder(list)
    end
    return list
  end

  def preorder(list)

    list.push(@key)

    if @left
      list = @right.preorder(list)
    end

    if @right
      list = @right.preorder(list)
    end
    return list
  end

  def find(key, bool)
    if @key == key
      bool = "yes"
    else
      if @left && @key > key
        bool = @left.find(key, bool)
      end

      if @right && @key < key
        bool = @right.find(key, bool)
      end
    end
    return bool
  end
end

n = gets.chomp.to_i
head = nil
n.times do
  num = gets.chomp.to_s
  if num == "print"
    puts "#{head.inorder([]).join(' ')}"
    puts "#{head.preorder([]).join(' ')}"
  else
    num == num.split
    if num[0].to_s == "insert"
      if head
        head.insert(num[1].to_i)
      else
        head = Tree.new(num[1].to_i)
      end
    else
      puts head.find(num[1].to_i, "no")
    end
  end
end