#include <iostream>

typedef char t_key;

struct node {node * left;
	node * right;
	t_key key;
};

node * create (t_key k) {
	node * temp = new node;
	temp->left = 0;
	temp->right = 0;
	temp->key = k;
	return temp;
}

void add (node ** root, t_key item){
	if (*root)
		if (item > (*root)->key)
			add (&((*root)->right), item);
		else    add (&((*root)->left ), item);
	else *root = create (item);
}

bool find (node * root, t_key item) {
	if (!root) return false;
	if (root->key == item)  return true;
	else if (item > root->key)
		return find (root->right, item);
	else return find (root->left, item);
}

int main ()
{
	node * root = 0;
	t_key input;
	while (true) {
		cin >> input;
		cout << "Suche: "   << find (root, input);
		cout << " anlegen!" << endl;
		add (&root, input);
	}
}