#include <bits/stdc++.h>

using namespace std;

using pii = pair<int, int>;
using vi = vector<int>;
using i64 = long long;

void encode() {
  static char s[610 * 12];
  string R;
  map<string, vector<string>> T;
  while (fgets(s, 11*600, stdin)) {
    int n = strlen(s);
    vector<string> vt;
    for (int i = 0; i < n; ++i) if (('a' <= s[i] && s[i] <= 'z') || ('A' <= s[i] && s[i] <= 'Z')) {
      int j = i;
      while (j < n && (('a' <= s[j] && s[j] <= 'z') || ('A' <= s[j] && s[j] <= 'Z'))) {
        ++j;
      }
      string t;
      for (int k = i; k < j; ++k) t.push_back(s[k]);
      vt.emplace_back(t);
      i = j-1;
    }
    if (R.empty()) {
      R = vt[0];
    }
    for (int j = 1; j < vt.size(); ++j) {
      T[vt[0]].push_back(vt[j]);
    }
  }
  assert(R.size());
  queue<string> q;
  q.push(R);
  string t;
  while (not q.empty()) {
    auto u = q.front(); q.pop();
    puts(u.c_str());
    t.push_back('0');
    auto vt = T[u];
    for (auto v: vt) {
      t.push_back('1');
      q.push(v);
    }
  }
  puts(t.c_str());
}
void decode() {
  queue<string> q;
  string s;
  while (cin >> s, s[0] != '0') {
    q.push(s);
  }
  reverse(s.begin(), s.end());
  queue<string> Q;
  Q.push(q.front());
  q.pop();
  while (not Q.empty()) {
    auto u = Q.front(); Q.pop();
    assert(s.back() == '0');
    s.pop_back();
    int k = 0;
    while (s.size() > 0 && s.back() == '1') {
      s.pop_back();
      k++;
    }
    if (k > 0) {
      printf("%s:", u.c_str());
      while (k--) {
        auto v = q.front(); q.pop();
        Q.push(v);
        printf(" %s", v.c_str());
      }
      puts("");
    }
  }
}

int main() {
  char s[12];
  fgets(s, 12, stdin);
  if (s[0] == 'E') {
    encode();
  } else {
    decode();
  }
  return 0;
}