#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+10;
int a[N]; //用前缀表示明明的得分，则a[i]-a[j]就是j-i之间的得分，
char c;

int main(){
    cin>>c;
    int len = 1;
    while(c != 'E'){
        if(c == 'W'){
            a[len] = a[len-1] + 1;
            len++;
        }else if( c == 'L'){
            a[len] = a[len-1];
            len++;
        }
        cin>>c;
    }
    len--;
    //11
    int p = 0;
    for(int i = 1; i <= len; i++){
        //a[i]-a[p]为p-i明明的得分
        if(a[i]-a[p] >= 11){
            if(abs(i-p-2*a[i]+2*a[p]) >= 2){
                printf("%d:%d\n",11,i-p-11);
                p = i;
            }
        }else if(i-p-a[i]+a[p] >= 11){
            //i-p-a[i]+a[p]为p-i对手的得分
            if(abs(i-p-2*a[i]+2*a[p]) >= 2){
                printf("%d:%d\n",a[i]-a[p],11);
                p = i;
            }
        }
    }
    printf("%d:%d\n",a[len]-a[p],len-p-a[len]+a[p]);
    printf("\n");
    //21
    p = 0;
    for(int i = 21; i <= len; i++){
        //a[i]-a[p]为p-i明明的得分
        if(a[i]-a[p] >= 21){
            if(abs(i-p-2*a[i]+2*a[p]) >= 2){
                printf("%d:%d\n",21,i-p-21);
                p = i;
            }
        }else if(i-p-a[i]+a[p] >= 21){
            //i-p-a[i]+a[p]为p-i对手的得分
            if(abs(i-p-2*a[i]+2*a[p]) >= 2){
                printf("%d:%d\n",a[i]-a[p],21);
                p = i;
            }
        }
    }
    printf("%d:%d\n",a[len]-a[p],len-p-a[len]+a[p]);
    return 0;
}