#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int main() {
	string s;
	cin >> s;
	
	vector<string> ans[101];
	
	int pos = 0;
	while (pos < s.size()) {
		string now = u8"";
		while (pos < s.size() && s.substr(pos, 2) != u8"ｗ") {
			now += s.substr(pos, 2);
			pos += 2;
		}
		
		int cnt = 0;
		while (pos < s.size() && s.substr(pos, 2) == u8"ｗ") cnt++, pos += 2;
		
		if (now != u8"") ans[cnt].push_back(now);
	}
	
	int mac = 0;
	REP(i, 101) if (ans[i].size() > 0) mac = i;
	
	if (mac == 0) puts("");
	else {
		for (int i = 0; i < ans[mac].size(); i++) {
			for (int j = 0; j < ans[mac][i].size(); j += 2)
				cout << ans[mac][i].substr(j, 2);
			puts("");
		}
	}
	
	return 0;
}