#include <bits/stdc++.h>
using namespace std;
const int N=1013,mod=998244353;
typedef long long ll;
typedef long double ld;
int input=0;
const ll inf=2e18;
//i day j site
string s[N];
int k[N],b[N],d[N];
void solve(){
    int dep=0,n;cin>>n;
    for(int i=1;i<=n;i++){
        cin>>s[i];
        d[i]=dep;
        if(s[i].back()=='{')dep++;else dep--,d[i]--;
        for(auto c:s[i])if(c=='s')b[i]++;else if(c=='t')k[i]++;
    }
    for(int i=1;i<=n;i++)cout<<d[i]<<":"<<k[i]<<' '<<b[i]<<'\n';
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cout<<fixed<<setprecision(10);
    int T;
    if(input)cin>>T;else T=1;
    for(int tc=1;tc<=T;tc++)solve();
}