import sys

sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]


def main():
    s=SI()
    n=len(s)
    if s.count("ｗ")==n:
        print("")
        exit()
    for i in range(n):
        if s[i]!="ｗ":
            s=s[i:]
            break
    if s.count("ｗ")==0:
        print("")
        exit()
    n=len(s)
    for i in range(n,0,-1):
        if s[i-1]=="ｗ":
            s=s[:i]
            break

    l=r=len(s)-1
    mx=0
    ans=[]
    while r>=0:
        cnt=1
        while r>0 and s[r-1]=="ｗ":
            r-=1
            cnt+=1
        l=r-1
        while l>0 and s[l-1]!="ｗ":l-=1
        if cnt==mx:
            ans.append(s[l:r])
        if cnt>mx:
            mx=cnt
            ans=[s[l:r]]
        r=l-1
    print(*ans,sep="\n")

main()