#include <iostream>
#include<bits/stdc++.h>
using namespace std;
typedef struct node{
char data;
int ltag,rtag;
struct node *lchild,*rchild;
}treeno,*treenode;
treenode p;
void cre(treenode &root){
char x;
cin>>x;
if(x=='@') root=NULL;
else{
root=new treeno;
root->data=x;
root->ltag=0;
root->rtag=0;
cre(root->lchild);
cre(root->rchild);
}
}
void t(treenode root){
if(root){
t(root->lchild);
if(root->lchild==NULL){
root->lchild=p;
root->ltag=1;
}
if(p->rchild==NULL){
p->rtag=1;
p->rchild=root;
}
p=root;
t(root->rchild);
}
}
treenode f(treenode root){
treenode head=new treeno;
head->lchild=root;
head->rchild=head;
head->ltag=0;
head->rtag=1;
p=head;
t(root);
head->rchild=p;
p->rchild=head;
return head;
}
void visit(treenode head){
treenode p;
p=head->lchild;
while(p!=head){
while(p->ltag==0) {
p=p->lchild;
}
cout<<p->data;
while(p->rtag==1){
p=p->rchild;
cout<<p->data;
}
p=p->rchild;
}
}
int main()
{
treenode root,head;
cre(root);
head=f(root);
visit(head);
//ABD@@E@@CF@@G@@
return 0;
}