#include<iostream>
#include<algorithm>
#include<string>
#include<stdio.h>
#include <iomanip>
#include <map>
#include <vector>
#include <stack>
#include <queue>

using namespace std;

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

string s1;
int len;

void construct_tree(node* &n)
{
	if (len == s1.length())
	{
		return;
	}
	char ch = s1[len++];
	if (ch == '#')
	{
		n = nullptr;
		return;
	}
	n = new node();
	n->ch = ch;
	n->left = nullptr;
	n->right = nullptr;
	construct_tree(n->left);
	construct_tree(n->right);
}

void inorder(node* n)
{
	if (n == nullptr)
	{
		return;
	}
	inorder(n->left);
	cout << n->ch << " ";
	inorder(n->right);
}

using ll = long long;

int main()
{
	ios::sync_with_stdio(false);

	while (cin >> s1)
	{
		node* root;
		len = 0;
		construct_tree(root);
		inorder(root);
		cout << endl;
	}
	
	return 0;
}