先读入所有的字母，再删去E后面所有的字母，先判断11分制，只要某一方大于等于11时，判断差分是否大于等于2，不满足就contine，最后剩下的分数再输出，然后21分制也是相同原理。

a = []
while True:
    try:
        s = input().strip()
        for i in s:
            a.append(i)
    finally:
        if 'E' in a:
            break

t = a.index('E')
for i in a[t:]:
    a.remove(i)

me = 0
you = 0
for i in range(0,len(a)):
    if a[i] == 'W':
        me += 1
    else:
        you += 1

    if me >= 11 or you >= 11:
        if max(me, you) - min(me, you) >= 2:
            print(f'{me}:{you}')
            me = 0
            you = 0
        else:
            continue
print(f'{me}:{you}')

print()

me = 0
you = 0
for i in range(0,len(a)):
    if a[i] == 'W':
        me += 1
    else:
        you += 1

    if me >= 21 or you >= 21:
        if max(me, you) - min(me, you) >= 2:
            print(f'{me}:{you}')
            me = 0
            you = 0
        else:
            continue
print(f'{me}:{you}')