#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
using namespace std;char s[3000];
int len;
bool exist;int main(){scanf("%s",&s);len=strlen(s);int i=0;while(true){if(s[i]=='W' && s[i+1]=='U' && s[i+2]=='B') i+=3;else break;}while(true){if(s[len-1]=='B' && s[len-2]=='U' && s[len-3]=='W') len-=3;else break;}while(i<len){if(s[i]=='W' && s[i+1]=='U' && s[i+2]=='B'){i+=3;if(!exist) printf(" ");exist=true;}else{cout<<s[i];i++;exist=false;}}cout<<endl;return 0;
}

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;char card[52][2];
int n,f[53][53][53][53];bool check(char a[2], char b[2]){return a[0]==b[0] || a[1]==b[1];
}bool dfs(int cur,int a,int b,int c){bool res=false;if(cur==1) return true;if(f[cur][a][b][c]) return false;if(check(card[a],card[b]))res|=dfs(cur-1,a,c,cur-3);if(!res && cur-3 && check(card[a],card[cur-3]))res|=dfs(cur-1,b,c,a);return !(f[cur][a][b][c]=!res);
}int main(){scanf("%d",&n);memset(f,false,sizeof(f));for(int i=1;i<=n;i++)scanf("%s",&card[i]);if(dfs(n,n,n-1,n-2))printf("YES\n");else printf("NO\n");return 0;
}

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <queue>
using namespace std;
template<class T>inline void gmax(T &a,T b){if(a<b)a=b;}int n,m,x,y,sp,dist[200],f[200][200],g[200][200],map[200][200],ans;
bool vis[200];
double res;struct EDGE{int pnt;EDGE *pre;EDGE(){}EDGE(int _pnt,EDGE *_pre):pnt(_pnt),pre(_pre){}
}Edge[20000],*SP=Edge,*edge[200];inline void addedge(int a,int b){edge[a]=new(++SP)EDGE(b,edge[a]);edge[b]=new(++SP)EDGE(a,edge[b]);
}       int main(){scanf("%d%d",&n,&m);for(int i=1;i<=m;i++){scanf("%d%d",&x,&y);addedge(x,y);map[x][y]=map[y][x]=1;}for(int k=1;k<=n;k++)for(int i=1;i<=n;i++)if(map[i][k])for(int j=1;j<=n;j++)if(map[k][j])if(!map[i][j] || map[i][j]>map[i][k]+map[k][j])map[i][j]=map[i][k]+map[k][j];sp=map[1][n];f[1][0]=1;for(int i=0;i<sp;i++)for(int j=1;j<=n;j++)for(EDGE *k=edge[j];k;k=k->pre)f[k->pnt][i+1]+=f[j][i];g[n][0]=1;for(int i=0;i<sp;i++)for(int j=1;j<=n;j++)for(EDGE *k=edge[j];k;k=k->pre)g[k->pnt][i+1]+=g[j][i];for(int i=2;i<n;i++)if(map[1][i]+map[i][n]==sp) gmax(ans,f[i][map[1][i]]*g[i][map[i][n]]);ans<<=1;gmax(ans,f[n][sp]);res=(double)ans/(double)f[n][sp];printf("%.12lf\n",res);return 0;
}

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
using namespace std;long long n,a[100],b[100],s[100],cur;long long exchange(long long x){for(int i=5;i>0;i--)b[i]+=x/a[i],x-=(x/a[i]*a[i]);return x;
}int main(){cin>>n;for(int i=1;i<=n;i++)cin>>s[i];cin>>a[1]>>a[2]>>a[3]>>a[4]>>a[5];cur=0;for(int i=1;i<=n;i++){cur+=s[i];if(cur>=a[1]) cur=exchange(cur);}for(int i=1;i<5;i++) cout<<b[i]<<" ";cout<<b[5]<<endl;cout<<cur<<endl;return 0;
}

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <algorithm>
#define MN 100010
using namespace std;vector<int> pos[MN],t;
int n,m,x,y,deep[MN],l[MN],r[MN],idx,fa[MN][20];struct EDGE{int pnt;EDGE *pre;EDGE(){}EDGE(int _pnt,EDGE *_pre):pnt(_pnt),pre(_pre){}
}Edge[MN],*SP=Edge,*edge[MN];inline void addedge(int a,int b){edge[a]=new(++SP)EDGE(b,edge[a]);
}void dfs(int x,int dep){deep[x]=dep;pos[dep].push_back(idx);l[x]=idx++;for(EDGE *j=edge[x];j;j=j->pre)dfs(j->pnt,dep+1);r[x]=idx;
}int main(){scanf("%d",&n);for(int i=1;i<=n;i++){scanf("%d",&fa[i][0]);addedge(fa[i][0],i);}dfs(0,0);for(int j=1;j<17;j++)for(int i=1;i<=n;i++)fa[i][j]=fa[fa[i][j-1]][j-1];scanf("%d",&m);while(m--){scanf("%d%d",&x,&y);t=pos[deep[x]];for(int i=0;i<17;i++)if(y>>i&1) x=fa[x][i];printf("%d ",x?lower_bound(t.begin(),t.end(),r[x])-lower_bound(t.begin(),t.end(),l[x])-1:0);}return 0;
}