#include<iostream>
#include<string.h>
using namespace std;

inline int max(int a,int b){
	return (a>b)?a:b;
}
inline int abs(int x){
	if(x==0) return x;
	else if(x>0) return x;
	else return ~x;
}
const int N=1e6+5;
int a[N];
int w=1,l=2;
int len;
int s1,s2;
int main(){
	char c;
	while(cin>>c && c!='E'){
		if(c=='W') a[++len]=w;
		if(c=='L') a[++len]=l;
	}
	int i;
	for(i=1;i<=len;i++){
		if(a[i]==w) s1++;
		if(a[i]==l) s2++;
		if(max(s1,s2)==11){
			while(abs(s1-s2)<2){
				i++;
				if(a[i]==w) s1++;
				if(a[i]==l) s2++;
			}
			cout<<s1<<':'<<s2<<"\n";
			s1=s2=0;
		}
	}	
	cout<<s1<<':'<<s2<<"\n";
	cout<<"\n";
	s1=s2=0;
	for(i=1;i<=len;i++){
		if(a[i]==w) s1++;
		if(a[i]==l) s2++;
		if(max(s1,s2)==21){
			while(abs(s1-s2)<2){
				i++;
				if(a[i]==w) s1++;
				if(a[i]==l) s2++;
			}
			cout<<s1<<':'<<s2<<"\n";
			s1=s2=0;
		}
	}	
	cout<<s1<<':'<<s2;
	return 0;
}

#2#3#4WA

#5#9RE

求调qwq