#include <iostream>
#include <queue>
using namespace std;
struct node{
	char c;
	node *left,*right;
};
int k=0;
char a;
string s="12300400506700800";
node *createtree(){
	node *p;
	//cin>>a;
	a=s[k++];
	if(a!='.'){
		p=new node;
		p->c=a;
		p->left = createtree();
		p->right = createtree();
	}
	else {
		p=NULL;
	}
	return p;
}

void zprintf(node *p){
	if(p==NULL) return ;
	zprintf(p->left);
	cout<<p->c;
	zprintf(p->right);
}
void hprintf(node *p){
	if(p==NULL) return ;
	hprintf(p->left);
	hprintf(p->right);
	cout<<p->c;
}
int main(){
	cin>>s;
	node *root = createtree();
	zprintf(root);
	cout<<endl;
	hprintf(root);
	return 0;
}