#include <bits/stdc++.h>
int cmp(const void *a, const void *b) { return (*(int *)a - *(int *)b); }
void scan_and_sort(int table[], int n, int sort) {
  for (int i = 0; i < n; i++) scanf("%d", &table[i]);
  if (sort) qsort(table, n, sizeof(int), cmp);
  return;
}
int main(int argc, char const *argv[]) {
  char s[201];
  scanf("%s", s);
  char table[201][201];
  int cnt = 0, ptr = 0, n = strlen(s);
  for (int i = 0; i < n; i++) {
    if (i < n - 2 && s[i] == 'W' && s[i + 1] == 'U' && s[i + 2] == 'B') {
      i += 2;
      if (ptr) cnt++;
      ptr = 0;
    } else
      table[cnt][ptr++] = s[i];
  }
  if (ptr) cnt++;
  for (int i = 0; i < cnt; i++)
    printf("%s%c", table[i], (i == cnt - 1) ? '\n' : ' ');
  return 0;
}
