Problem: Vasya works as a DJ in the best Berland nightclub, and he often uses dubstep music in his performance. Recently, he has decided to take a couple of old songs and make dubstep remixes from them.

Let's assume that a song consists of some number of words. To make the dubstep remix of this song, Vasya inserts a certain number of words "WUB" before the first word of the song (the number may be zero), after the last word (the number may be zero), and between words (at least one between any pair of neighbouring words), and then the boy glues together all the words, including "WUB", in one string and plays the song at the club.

For example, a song with words "I AM X" can transform into a dubstep remix as "WUBWUBIWUBAMWUBWUBX" and cannot transform into "WUBWUBIAMWUBX".

Recently, Petya has heard Vasya's new dubstep track, but since he isn't into modern music, he decided to find out what was the initial song that Vasya remixed. Help Petya restore the original song.

Input

The input consists of a single non-empty string, consisting only of uppercase English letters, the string's length doesn't exceed 200 characters. It is guaranteed that before Vasya remixed the song, no word contained substring "WUB" in it; Vasya didn't change the word order. It is also guaranteed that initially the song had at least one word.

Output

Print the words of the initial song that Vasya used to make a dubsteb remix. Separate the words with a space.

Examples

Input

WUBWUBABCWUB


Output

ABC 

Input

WUBWEWUBAREWUBWUBTHEWUBCHAMPIONSWUBMYWUBFRIENDWUB


Output

WE ARE THE CHAMPIONS MY FRIEND 

Note

In the first sample: "WUBWUBABCWUB" = "WUB" + "WUB" + "ABC" + "WUB". That means that the song originally consisted of a single word "ABC", and all words "WUB" were added by Vasya.

In the second sample Vasya added a single word "WUB" between all neighbouring words, in the beginning and in the end, except for words "ARE" and "THE" — between them Vasya added two "WUB".

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long int BS(vector<long long int>& V, long long int low,
                 long long int high, long long int key);
void SieveOfEratosthenes(vector<long long int>& V, long long int num);
long long int gcd(long long int a, long long int b);
long long int lcm(long long int a, long long int b);
unsigned long long int modularExponentiation(unsigned long long int x,
                                             unsigned long long int n,
                                             unsigned long long int M);
int main() {
  string S;
  cin >> S;
  unsigned long long int i = 0;
  if (S.size() > 3) {
    while (i <= S.size() - 3) {
      if (S[i] == 'W') {
        if (S[i + 1] == 'U') {
          if (S[i + 2] == 'B') {
            S[i] = S[i + 1] = S[i + 2] = 48;
          } else {
            i++;
          }
        } else
          i++;
      } else
        i++;
    }
    i = 0;
    while (S[i] == 48) {
      i++;
    }
    while (S[i] != '\0') {
      if (S[i] != 48) {
        cout << S[i];
      } else {
        cout << " ";
      }
      i++;
    }
  } else {
    if (S.size() == 3) {
      if (S != "WUB") cout << S;
    } else {
      cout << S;
    }
  }
  cout << endl;
  return 0;
}
long long int BS(vector<long long int>& V, long long int low,
                 long long int high, long long int key) {
  int mid = (low + high) / 2;
  if (low <= high) {
    if (key == V[mid]) {
      return mid;
    } else if (key < V[mid]) {
      return BS(V, low, mid - 1, key);
    } else
      return BS(V, mid + 1, high, key);
  }
  return mid;
}
void SieveOfEratosthenes(vector<long long int>& V, long long int num) {
  bool prime[num + 1];
  memset(prime, true, sizeof(prime));
  for (long long int p = 2; p * p <= num; p++) {
    if (prime[p] == true) {
      for (long long int i = p * p; i <= num; i += p) prime[i] = false;
    }
  }
  for (long long int p = 2; p <= num; p++)
    if (prime[p]) V.push_back(p);
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  return (a * b) / gcd(a, b);
}
unsigned long long int modularExponentiation(unsigned long long int x,
                                             unsigned long long int n,
                                             unsigned long long int M) {
  unsigned long long int result = 1;
  while (n > 0) {
    if (n % 2 == 1) result = (result * x) % M;
    x = (x * x) % M;
    n = n / 2;
  }
  return result;
}