/* name: 6552
 * author: 5ab
 * created at: 2023-07-05
 */
#include <iostream>
#include <bitset>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define ssz(x) (int((x).size()))

using ll = long long;
const int max_n = 2000;

bitset<max_n> a[max_n], b[max_n], bs[max_n], ok;
int p[max_n];
char tmp[10];

signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int cas, n;
	
	cin >> cas;
	while (cas--)
	{
		cin >> tmp >> n;
		for (int i = 0; i < n; i++)
			cin >> a[i];
		
		auto fndlst = [&](const bitset<max_n>& x) {
			for (int j = n - 1; j >= 0; j--)
				if (x.test(j))
					return j;
			return -1;
		};
		
		for (int i = 0; i < n; i++)
			b[i].reset();
		if (tmp[0] == 'l')
		{
			ok.set();
			for (int i = 0; i < n; i++)
			{
				p[i] = fndlst(ok & a[i]);
				ok.set(p[i], 0);
			}
			for (int i = 0; i < n; i++)
			{
				b[i] ^= a[i];
				for (int j = i + 1; j < n; j++)
					if (p[j] < p[i] && a[j].test(p[i]))
					{
						a[j].set(p[i], 0);
						b[j] ^= a[i];
					}
			}
		}
		else
		{
			for (int i = 0; i < n; i++)
				bs[i].reset();
			ok.reset();
			for (int i = 0; i < n; i++)
			{
				for (int j = n - 1; j >= 0; j--)
					if (a[i].test(j))
					{
						if (!ok.test(j))
						{
							bs[j] = a[i];
							ok.set(j);
							break;
						}
						a[i] ^= bs[j];
						b[i].set(j);
					}
				b[i] ^= a[i];
			}
		}
		
		cout << n << "\n";
		for (int i = 0; i < n; i++)
		{
			for (int j = n - 1; j >= 0; j--)
				cout << b[i].test(j);
			cout << "\n";
		}
	}
	
	return 0;
}
// started coding at: 07-05 13:28:48