#include<iostream>
using namespace std;
typedef struct BTNode{
char data;
BTNode *l,*r;
}BT;
//创建二叉树
void create(BT *&t){
char ch;
cin>>ch;
if(ch=='\n')return;
if(ch=='#')t=NULL;
else{
t=new BT;
t->data=ch;
create(t->l);
create(t->r);
}
}
//实现中序遍历
void inoderT(BT *t){
if(t){
inoderT(t->l);
cout<<t->data;
inoderT(t->r);
}else return;
}
int main(){
BT *t;
create(t);
inoderT(t);
return 0;
}