#include<stdio.h>
#include<stdlib.h>

struct Node {
    int key;
    struct Node *right, *left, *parent;
};

struct Node *root, *NIL;

void insert(int k){
    struct Node *y = NIL;
    struct Node *x = root;
    struct Node *z;

    z=(struct Node *)malloc(sizeof(struct Node));
    z->key = k;
    z->left = NIL;
    z->right = NIL;

    while(x!= NIL){
        y = x;
        if(z->key < x->key){
            x = x->left;
        }
	else x = x->right;
    }
    
    z->parent = y;
    if(y == NIL){
        root = z;
    }
    else{
        if( z->key < y->key){
            y->left = z;
        }
	else y->right = z;
    }

}

void find(int key){
    struct Node *x = root;

    while(x != NIL){
        if(x->key > key){
            x = x->left;
        }
	else if(x->key < key) {
            x = x->right;
        }
	else{
            printf("yes\n");
            return;
        }
    }

    printf("no\n");
}

void inorder(struct Node *u){
    if(u == NIL) return;
    inorder(u->left);
    printf(" %d", u->key);
    inorder(u->right);
}

void preorder(struct Node *u){
    if(u == NIL) return;
    printf(" %d", u->key);
    preorder(u->left);
    preorder(u->right);
}

int main(){
    int n, i, a;
    char com[10];
    scanf("%d", &n);

    for(i = 0; i < n; i++){
        scanf("%s", com);
        if(com[0] == 'i'){
            scanf("%d", &a);
            insert(a);
        }
	else if(com[0] == 'f'){
            scanf("%d", &a);
            find(a);
        }
	else{
            inorder(root);
            printf("\n");
            preorder(root);
            printf("\n");

        }
    }

    return 0;
}

