#include <stdlib.h>
#include <stdio.h>
 
typedef struct node{
	int key;
	int size;
	struct node *left;
	struct node *right;
}tree;
 
tree * insert(tree *root, int value){
	if(root == NULL){
		root = (tree *)malloc(sizeof(tree));
		root->key = value;
		root->left = root->right = 0;
		root->size = 1;
		return root;
	}
	if(value > root->key)
		root->right = insert(root->right, value);
	else
		root->left = insert(root->left, value);
	return root;
}
 
int main(void){
	return 0;
}

I2luY2x1ZGUgPHN0ZGxpYi5oPgojaW5jbHVkZSA8c3RkaW8uaD4KCnR5cGVkZWYgc3RydWN0IG5vZGV7CglpbnQga2V5OwoJaW50IHNpemU7CglzdHJ1Y3Qgbm9kZSAqbGVmdDsKCXN0cnVjdCBub2RlICpyaWdodDsKfXRyZWU7Cgp0cmVlICogaW5zZXJ0KHRyZWUgKnJvb3QsIGludCB2YWx1ZSl7CglpZihyb290ID09IE5VTEwpewoJCXJvb3QgPSAodHJlZSAqKW1hbGxvYyhzaXplb2YodHJlZSkpOwoJCXJvb3QtPmtleSA9IHZhbHVlOwoJCXJvb3QtPmxlZnQgPSByb290LT5yaWdodCA9IDA7CgkJcm9vdC0+c2l6ZSA9IDE7CgkJcmV0dXJuIHJvb3Q7Cgl9CglpZih2YWx1ZSA+IHJvb3QtPmtleSkKCQlyb290LT5yaWdodCA9IGluc2VydChyb290LT5yaWdodCwgdmFsdWUpOwoJZWxzZQoJCXJvb3QtPmxlZnQgPSBpbnNlcnQocm9vdC0+bGVmdCwgdmFsdWUpOwoJcmV0dXJuIHJvb3Q7Cn0KCmludCBtYWluKHZvaWQpewoJcmV0dXJuIDA7Cn0=