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

struct node {
    char code;
    struct node* left;
    struct node* right;
};

struct node* build_tree(const char* str, int* pindex, int end) {
    if (*pindex >= end) return NULL; 

    char code = str[(*pindex)++];
    if (code == '#') return NULL;

    struct node* root = (struct node*)malloc(sizeof(struct node));
    root->code = code;

    root->left = build_tree(str, pindex, end);
    root->right = build_tree(str, pindex, end);

    return root;
}

void destroy_tree(struct node* root) {
    if (root == NULL) return;
    destroy_tree(root->left);
    destroy_tree(root->right);
    free(root);
}

void print_tree(struct node* root) {
    if (root == NULL) return;
    print_tree(root->left);
    printf("%c ", root->code);
    print_tree(root->right);
}

int main() {
    char str[128];

    while (scanf("%s", str) != -1) {
        in...