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 JAVA):

Solution:
import java.lang.*;
import java.io.*;
import java.util.*;
import java.math.*;
 
public class Main implements Runnable{
	public static int low=0, high=0;
	public static void main(String args[] ) throws Exception {
		new Thread(null, new Main(),"Main",1<<27).start();
	}
	//---------------------------------Actual CODE---------------------------------------//
	public void run() {
		InputReader in = new InputReader(System.in);
	    PrintWriter out = new PrintWriter(System.out); 
//	    int t = in.nextInt();
//        while(t-- > 0)
        {
        	char c[]=in.next().toCharArray();
        	int i=0, n=c.length;
        	boolean space=false, first=true;
        	while(i<n) {
        		if(i+2<n && c[i]=='W' && c[i+1]=='U' && c[i+2]=='B') {
        			if(i==0)
        				first=false;
        			else
        				first=true;
        			i=i+2;
        			space=true;
        		}else if(i+1<n && c[i]=='W' && c[i+1]=='U'){
        			out.print(c[i]+""+c[i+1]);
        			i+=1;
        			space=false;
        		}else {
    				if(space && first) {
    					out.print(" ");
    					space=false;
    				}
    				out.print(c[i]);
        		}
        		i++;
        	}
        }
	    out.close();
	}
	//----------------------------------------------------------------------------------//
	public static int subarraysum(int a[], int n) {
		int maxcurr=a[0], max=a[0];
		for(int i=1;i<n;i++) {
			maxcurr=Math.max(a[i], a[i]+maxcurr);
			max=Math.max(maxcurr, max);
		}
		return max;
	}
	public static void mergeSort(int a[], int l, int h) {
		if(l<h) {
			int mid=(l+h)/2;	
			mergeSort(a, l, mid);
			mergeSort(a, mid+1, h);
			merge(a, l, mid, h);
		}
	}
	public static void merge(int a[], int l, int mid, int h) {
		int m1[]=Arrays.copyOfRange(a, l, mid+1 );
		int m2[]=Arrays.copyOfRange(a, mid+1, h+1);
		int i=0,j=0,k=l;
		while(i<m1.length && j<m2.length) {
			if(m1[i]<=m2[j])
				a[k++]=m1[i++];
			else
				a[k++]=m2[j++];
		}
		while(i<m1.length)
			a[k++]=m1[i++];
		while(j<m2.length)
			a[k++]=m2[j++];
	}
	public static void quickSort(int a[], int l, int h) {
		if(l<h) {
			int pivotindx=partition(a,l,h);
		quickSort(a, l, pivotindx-1);	
			quickSort(a, pivotindx+1, h);
		}
	}
	public static int partition(int a[], int l, int h) {
		int pivot=a[h], p_inx=l, temp=0;
		for(int i=l;i<h;i++) {
			if(a[i]<=pivot) {
				temp=a[i];
				a[i]=a[p_inx];
				a[p_inx]=temp;
				p_inx++;
			}
		}
		temp=a[h];
		a[h]=a[p_inx];
		a[p_inx]=temp;
		return p_inx;		
	}
	public static int binarySearch(int a[], int l, int h, int x) {
		while(l<=h) {
			int mid=l+(h-l)/2;
			if(a[mid]==x)
				return mid;
			else if(a[mid]<x)
				l=mid+1;
			else
				h=mid-1;
		}
		return -1;
	}
	public static int gcd(int a, int b) {
		if(b==0)
			return a;
		else
			return gcd(b,a%b);
		
	}
    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private SpaceCharFilter filter;
        private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
 
        public InputReader(InputStream stream) {
            this.stream = stream;
        }
       
        public int read() {
            if (numChars==-1)
                throw new InputMismatchException();
           
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                }
                catch (IOException e) {
                    throw new InputMismatchException();
                }
            
                if(numChars <= 0)              
                    return -1;
            }
            return buf[curChar++];
        }
     
        public String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            }
            catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
        public int nextInt() {
            int c = read();
           
            while(isSpaceChar(c))
                c = read();
           
            int sgn = 1;
           
            if (c == '-') {
                sgn = -1;
                c = read();
            }
           
            int res = 0;
            do {
                if(c<'0'||c>'9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            while (!isSpaceChar(c));
           
            return res * sgn;
        }
       
        public long nextLong() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            long res = 0;
           
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            while (!isSpaceChar(c));
                return res * sgn;
        }
       
        public double nextDouble() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            double res = 0;
            while (!isSpaceChar(c) && c != '.') {
                if (c == 'e' || c == 'E')
                    return res * Math.pow(10, nextInt());
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            if (c == '.') {
                c = read();
                double m = 1;
                while (!isSpaceChar(c)) {
                    if (c == 'e' || c == 'E')
                        return res * Math.pow(10, nextInt());
                    if (c < '0' || c > '9')
                        throw new InputMismatchException();
                    m /= 10;
                    res += (c - '0') * m;
                    c = read();
                }
            }
            return res * sgn;
        }
       
        public String readString() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();	
            do {
                res.appendCodePoint(c);
                c = read();
            }
            while (!isSpaceChar(c));
           
            return res.toString();
        }
     
        public boolean isSpaceChar(int c) {
            if (filter != null)
                return filter.isSpaceChar(c);
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }
     
        public String next() {
            return readString();
        }
       
        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);
        }
    }
}