#include<algorithm>

 #include<iostream>

 #include<cstring>

 #include<cstdio>

 #include<cmath>

 #include<queue>

 #define inf 2147483647

 #define eps 1e-9

 using namespace std;

 typedef long long ll;

 typedef double db;

 int q,cnt=,anss,top[],last[],son[][],len[],fail[],dep[],st[];

 ll ans=;

 char op[],x[];

 int newn(int l){

     len[cnt]=l;

     return cnt++;

 }

 void init(){

     memset(son,,sizeof(son));

     memset(st,-,sizeof(st));

     newn();

     newn(-);

     top[]=q+;

     top[]=q+;

     last[]=last[]=;

     fail[]=;

 }

 int getfail(int u,int op){

     while(st[top[op]]!=st[top[op]+(op?-:)*(len[u]+)])u=fail[u];

     return u;

 }

 void extend(int ch,int op){

     if(op)st[++top[op]]=ch;

     else st[--top[op]]=ch;

     int nw=getfail(last[op],op);

     if(!son[nw][ch]){

         int nn=newn(len[nw]+);

         fail[nn]=son[getfail(fail[nw],op)][ch];

         dep[nn]=dep[fail[nn]]+;

         if(len[nn]==top[]-top[]+)last[op^]=nn;

         son[nw][ch]=nn;

     }

     last[op]=son[nw][ch];

     ans+=dep[last[op]];

 }

 int main(){

     scanf("%d",&q);

     init();

     while(q--){

         scanf("%s%s",op,x);

         extend(x[]-'a',op[]=='r');

         printf("%lld %d\n",ans,cnt-);

     }

     return ;

 }