#include<iostream>

using namespace std;

void dfs(string s, int &k) {

	if (s[k] == '#' || k >= s.size()) {
		k ++ ;
		return;
	}
	char t = s[k ++ ];
	dfs(s, k);
	cout << t << ' ';
	dfs(s, k);
}

int main() {
	string s;
	while (cin >> s) {
		int k = 0;
		dfs(s, k);
		cout << endl;
	}
	return 0;
}

#include<iostream>

using namespace std;

struct binary_tree {
    char val;
    struct binary_tree *lchild;
    struct binary_tree *rchild;
};

binary_tree *creat_tree(string s, int &k) {
    if (k >= s.size() || s[k] == '#') {
        k ++ ;
        return NULL; 
    }
    binary_tree *root = new binary_tree();

    root->val = s[k ++ ];
    root->lchild = creat_tree(s, k);
    root->rchild = creat_tree(s, k);
    return root;
}

void InOrder(binary_tree *root) {
    if (root == NULL) return;
    InOrder(root->lchild);
    cout << root->val << ' ';
    In...