#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define MAX 1000000009
#define FRE() freopen("in.txt","r",stdin)
#define FRO() freopen("out.txt","w",stdout)
using namespace std;
typedef long long ll;
const int maxn = 200010;
int n,m,d[maxn],vis[maxn];
struct Card {char number;char color;Card() {}Card(char n, char c):number(n),color(c) {}
};
vector<stack<Card> > pile;void makeString(string str) {//处理字符串，保存所有的牌//cout<<str<<endl;for(int i = 0; i<str.length(); i+=3) {stack<Card> sta;sta.push(Card(str[i],str[i+1]));pile.push_back(sta);}
}bool judge(Card a,Card b) {//判断两张牌是否可以匹配if(a.color==b.color || a.number==b.number) {return true;}return false;
}void solve() {
//    for(int i = 0; i<52; i++){
//        cout<<pile[i].top().number<<pile[i].top().color<<" ";
//        if(i==25)
//            cout<<endl;
//    }
//    cout<<endl;while(true) {bool ok = false;for(int i=0; i<pile.size(); i++) {if(i-3>=0 && judge(pile[i].top(),pile[i-3].top())) {//移动3格pile[i-3].push(pile[i].top());pile[i].pop();ok = true;if(pile[i].empty()) {pile.erase(pile.begin()+i);}break;} else if(i-1>=0 && judge(pile[i].top(),pile[i-1].top())) {//移动1格pile[i-1].push(pile[i].top());pile[i].pop();ok = true;if(pile[i].empty()) {pile.erase(pile.begin()+i);}break;}}if(!ok) {break;}}cout<<pile.size();if(pile.size()==1){cout<<" pile remaining: 52"<<endl;}else{cout<<" piles remaining:";for(int i=0; i<pile.size(); i++){cout<<" "<<pile[i].size();}cout<<endl;}
}int main() {//FRE();string str;while(true) {pile.clear();int idx=1;getline(cin,str);if(str=="#") {break;}makeString(str);getline(cin,str);makeString(str);solve();}return 0;
}