use std::boxed::Box;
use std::io::Read;
use std::string::String;

fn main() {
    let mut buf = String::new();
    std::io::stdin().read_to_string(&mut buf).unwrap();

    let answer = solve(&buf);

    print!("{}", answer);
}

fn solve(input: &str) -> String {
    let mut iterator = input.split_whitespace();

    let n: usize = iterator.next().unwrap().parse().unwrap();

    let mut tree: BinarySearchTree = BinarySearchTree::new();

    let mut result = String::new();
    for _ in 0..n {
        let command = iterator.next().unwrap();
        if command == "insert" {
            let k: i64 = iterator.next().unwrap().parse().unwrap();
            tree.insert(k);
        } else if command == "find" {
            let k: i64 = iterator.next().unwrap().parse().unwrap();
            if tree.find(k) {
                result.push_str("yes\n");
            } else {
                result.push_str("no\n");
            }
        } else {
            tree.print_in_order(&mut result);
            result.push('\n');
            tree.print_pre_order(&mut result);
            result.push('\n');
        }
    }

    return result;
}

enum BinarySearchTree {
    Node {
        value: i64,
        left: Box<BinarySearchTree>,
        right: Box<BinarySearchTree>,
    },
    Nil,
}

impl BinarySearchTree {
    fn new() -> Self {
        BinarySearchTree::Nil
    }

    fn insert(&mut self, new_value: i64) {
        match *self {
            BinarySearchTree::Nil => {
                *self = BinarySearchTree::Node {
                    value: new_value,
                    left: Box::new(BinarySearchTree::Nil),
                    right: Box::new(BinarySearchTree::Nil),
                }
            },
            BinarySearchTree::Node {
                ref mut value,
                ref mut left,
                ref mut right
            } => {
                if new_value < *value {
                    left.insert(new_value)
                } else {
                    right.insert(new_value)
                }
            },
        }
    }

    fn find(&self, search_value: i64) -> bool {
        match *self {
            BinarySearchTree::Nil => {
                false
            },
            BinarySearchTree::Node {
                ref value,
                ref left,
                ref right
            } => {
                if search_value == *value {
                    true
                } else if search_value < *value {
                    left.find(search_value)
                } else {
                    right.find(search_value)
                }
            }
        }
    }

    fn print_in_order(&self, buf: &mut String) {
        match *self {
            BinarySearchTree::Nil => {},
            BinarySearchTree::Node {
                ref value,
                ref left,
                ref right
            } => {
                left.print_in_order(buf);
                buf.push_str(&format!(" {}", value));
                right.print_in_order(buf);
            }
        }
    }

    fn print_pre_order(&self, buf: &mut String) {
        match *self {
            BinarySearchTree::Nil => {},
            BinarySearchTree::Node {
                ref value,
                ref left,
                ref right
            } => {
                buf.push_str(&format!(" {}", value));
                left.print_pre_order(buf);
                right.print_pre_order(buf);
            }
        }
    }
}



Measured memory_bytes: 48204