#define _CRT_SECURE_NO_WARNINGS

#include "stdio.h"

#include<stdio.h>

#include<algorithm>

#include<string>

#include<vector>

#include<list>

#include<set>

#include<iostream>

#include<string.h>

#include<queue>

using namespace std;

const int maxn = ;

char s[maxn];

int failed;

struct node {

    int v;

    bool have_v;

    node* leftson, *rightson;

    node() :have_v(false), leftson(NULL), rightson(NULL) {}

}*root;

node* newnode() { return new node(); }

void addnode(int v, char *s) {

    int n = strlen(s);

    node * now = root;

    for (int i = ; i < n - ; i++) {

        if (s[i] == 'L') {

            if (now->leftson == NULL) now->leftson = newnode();

            now = now->leftson;

        }

        else {

            if (now->rightson == NULL) now->rightson = newnode();

            now = now->rightson;

        }

    }

    if (now->have_v) { failed = ; }

    now->v = v;

    now->have_v = ;

}

bool read_input() {

    failed = false; root = newnode();

    while () {

        while (scanf("%s", &s) != )return false;

        if (s[] == ')')break;

        int v;

        sscanf(&s[], "%d", &v);

        addnode(v, strchr(s, ',') + );

    }

    return true;

}

list<int>ans;

void bfs() {

    ans.clear();

    queue<node> Q;

    node now;

    //int vis[maxn];

    Q.push(*root);

    while (!Q.empty()) {

        now = Q.front(); if (!now.have_v) { failed = ; break; }

        Q.pop();

        if (now.leftson != NULL)Q.push(*now.leftson);

        if (now.rightson != NULL)Q.push(*now.rightson);

        ans.push_back(now.v);

    }

}

int main() {

    while (read_input()) {

        bfs();

        if (failed)cout << "not complete" ;

        else

        {

            cout << ans.front(); ans.pop_front();

            for (auto t : ans)cout << ' ' << t;

        }

        cout << endl;

    }

    system("pause");

}