//
//
#include <iostream>
using namespace std;

typedef struct Node{
	char ch;
	struct Node *lchild,*rchild;
} *node;

string str; int len;

void createBitTree(node &n){
	if(len == str.size()) return;
	char c = str[len++];
	if(c == '#') n = NULL;
	//->是可以给指针用的 
	else{
		n = new Node;
		n->ch = c;
		//RE报错
		//初始化不完全
		n->lchild = NULL; 
		n->rchild = NULL; 
		createBitTree(n->lchild); 
		createBitTree(n->rchild); 
	}
}

void inOrderTraverse(node n){
	if(n != NULL){
		inOrderTraverse(n->lchild);
		cout<<n->ch<<' ';
		inOrderTraverse(n->rchild);
	}
}


int main(){
	while(cin>>str){
		len = 0;
		node n;
		createBitTree(n);
		inOrderTraverse(n);cout<<endl;
		//有多次输入 
		//PE错误就是要补上格式 
	}
	
	return 0;
}