#include <bits/stdc++.h>
using namespace std;

#define int long long
#define double long double

#define pii pair<int, int>

array<vector<int>, 3> v, b;
vector<int> p(20), q(20);
vector<pii> r;

void solve(int n, int i = -1, bool z = true) {
	if (n == 0) {
		return;
	}
	if (z) {
		i = q[n];
	}
	//cout << "task: move " << n << " to " << i+1 << endl;
	if (p[n] == i) {
		solve(n - 1, i, z);
		return;
	}
	for (int j = 0; j < 3; j++) {
		if (p[n] != j && i != j) {
			solve(n - 1, j, false);
			break;
		}
	}
	r.emplace_back(p[n], i);
	p[n] = i;
	solve(n - 1, i, z);
}

signed main() {
#ifdef CB
	ifstream fin("be1.txt");
	cin.rdbuf(fin.rdbuf());
#endif
	int N = 0;
	for (int i = 0; i < 3; i++) {
		while (true) {
			int x;
			cin >> x;
			if (x == 0) {
				break;
			}
			v[i].push_back(x);
			p[x] = i;
			N++;
		}
	}
	for (int i = 0; i < 3; i++) {
		while (true) {
			int x;
			cin >> x;
			if (x == 0) {
				break;
			}
			b[i].push_back(x);
			q[x] = i;
		}
	}
	solve(N);
	cout << r.size() << endl;
	for (int i = 0; i < r.size(); i++) {
		cout << r[i].first + 1 << " " << r[i].second + 1 << endl;
	}
	return 0;
}