#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

map<char, int> value;
void init()
{
	FOR(i, 2, 10)
		value[char('0' + i)] = i;
	value['T'] = 10;
	value['J'] = 11;
	value['Q'] = 12;
	value['K'] = 13;
	value['A'] = 14;
}


const int SZ = 13;
void solve()
{
	VI a(SZ);
	vector<string> s(SZ);
	FOR(i, 0, SZ)
	{
		cin >> s[i];
		a[i] = value[s[i][0]];
	}
	
	VI ok(1 << SZ, 0);
	FOR(mask, 1, 1 << SZ)
	{
		VI vals;
		FOR(i, 0, SZ)
		{
			if(mask & (1 << i))
				vals.PB(a[i]);
		}
		sort(ALL(vals));
		bool stre = true;
		FOR(i, 0, SZ(vals))
			stre &= vals[i] == vals[0] + i;
		if(vals.back() == vals[0] || (stre && SZ(vals) >= 5))
		{
			ok[mask] = 1;
			continue;
		}
		if(SZ(vals) == 5)
		{
			int cnt0 = 0, cnt1 = 0;
			for(int x : vals)
			{
				if(x == vals[0])
					cnt0++;
				if(x == vals.back())
					cnt1++;
			}
			if(min(cnt0, cnt1) == 2 && max(cnt0, cnt1) == 3)
				ok[mask] = 1;
		}
	}

	VI dp(1 << SZ, SZ + 1);
	VI to(1 << SZ, -1);
	dp[0] = 0;
	
	FOR(mask, 1, 1 << SZ)
	{
		for(int submask = mask; submask > 0; submask = (submask - 1) & mask)
		{
			if(ok[submask] && dp[mask ^ submask] + 1 < dp[mask])
			{
				dp[mask] = dp[mask ^ submask] + 1;
				to[mask] = submask;
			}
		}
	}
	int mask = (1 << SZ) - 1;
	cout << dp[mask] << "\n";
	while(mask)
	{
		int sub = to[mask];
		
		VI poses;
		FOR(i, 0, SZ)
		{
			if(sub & (1 << i))
				poses.PB(i);
		}
		FOR(i, 0, SZ(poses))
		{
			if(i)
				cout << " ";
			cout << s[poses[i]];
		}
		cout << "\n";
		
		mask ^= sub;
	}
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	init();
	
	int t;
	cin >> t;
	while(t--)
		solve();
	
	return 0;
}