# include<iostream>

# include<cstdio>

# include<map>

# include<stack>

# include<cstring>

# include<algorithm>

using namespace std;

struct Poke

{

    char v,f;

    Poke(char _v,char _f):v(_v),f(_f){}

};

char str[2];

stack<Poke>s[52];

int get(int pos,int k)

{

    for(int i=pos-1;i>=0;--i){

        if(!s[i].empty()){

            --k;

            if(k==0)  return i;

        }

    }

    return -1;

}

bool match(const Poke &a,const Poke &b)

{

    return a.v==b.v||a.f==b.f;

}

bool toDo(int i,int k)

{

    Poke a=s[i].top();

    Poke b=s[k].top();

    if(match(a,b)){

        s[k].push(a);

        s[i].pop();

        return true;

    }

    return false;

}

void solve()

{

    int i;

    while(1)

    {

        for(i=1;i<52;++i){

            if(s[i].empty())

                continue;

            int k=get(i,3);

            if(k!=-1&&toDo(i,k))

                break;

            k=get(i,1);

            if(k!=-1&&toDo(i,k))

                break;

        }

        if(i>=52)

            break;

    }

}

int main()

{

    while(scanf("%s",str))

    {

        if(str[0]=='#')

            break;

        for(int i=0;i<52;++i)

            while(!s[i].empty())

                s[i].pop();

        s[0].push(Poke(str[0],str[1]));

        for(int i=1;i<52;++i){

            scanf("%s",str);

            s[i].push(Poke(str[0],str[1]));

            Poke u=s[i].top();

        }

        solve();

        int k=0;

        for(int i=0;i<52;++i)

            if(!s[i].empty())

                ++k;

        if(k==1)

            printf("1 pile remaining: 52\n");

        else{

            printf("%d piles remaining:",k);

            for(int i=0;i<52;++i)

                if(!s[i].empty())

                    printf(" %d",s[i].size());

            printf("\n");

        }

    }

    return 0;

}