#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <cstring>
#include <iterator>
#include <cmath>
#include <algorithm>
#include <stack>
#include <deque>
#include <map>
#include <set>
#include <queue>
#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
#define mem0(a) memset(a,0,sizeof(a))
#define sca(x) scanf("%d",&x)
#define de printf("=======\n")
typedef long long ll;
using namespace std;struct node {bool yo;int value;node * l;node * r;node() {yo = false;value = 0;l = r = NULL;}};
node * root;
bool failed;
vector<int> ans;
int cnt;node * new_node() {return new node();
}void addnode( int v, char * p ) {int n = (int)strlen(p);node * u = root;for( int i = 0; i < n; i++ ) {if( p[i] == 'L' ) {if( u->l == NULL ) u->l = new_node();u = u->l;}else if( p[i] == 'R' ) {if( u->r == NULL ) u->r = new_node();u = u->r;}}if( u->yo == true ) {failed = true;return;}u->value = v;u->yo = true;
}bool readin() {char s[290];while( 1 ) {if( scanf( "%s", s ) != 1 ) return false;if( strcmp(s, "()") == 0 ) break;int v;sscanf( &s[1], "%d", &v );addnode( v, strchr(s, ',')+1 );}return true;
}bool bfs() {queue<node *> q;q.push(root);while( !q.empty() ) {node * temp = q.front();q.pop();if( temp->yo == false ) return 0;ans.push_back(temp->value);if( temp->l ) q.push(temp->l);if( temp->r ) q.push(temp->r);}return 1;
}
int main() {while(1) {cnt = 0;failed = 0;root = new_node();ans.clear();if( !readin() ) break;if( !failed && bfs() ) {int len = (int)ans.size();for (int i = 0; i < len; i++)printf("%d%c", ans[i], i == len - 1 ? '\n' : ' ');}else {puts( "not complete" );}}return 0;
}