#include <bits/stdc++.h>
using namespace std;
#define nl << '\n'
#define sp << ' '
#define int long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define ins insert
#define ii pair<int, int>
const int maxn = 1e3 + 69;
vector<int> arr[maxn];
vector<ii> locate[maxn];
int cnt = 0; vector<ii> res;

void swap(int i, int j) {
	cnt++; res.pb({i, j}); vector<ii> cur;
	int x = arr[i][arr[i].size() - 1];
	arr[i].pop_back(); arr[j].pb(x);
	while (!locate[x].empty()) {
		if (locate[x][locate[x].size() - 1].fi == arr[i].size() && locate[x][locate[x].size() - 1].se == i) {locate[x].pop_back(); cur.pb({3 - arr[j].size(), j});}
		else {cur.pb(locate[x][locate[x].size() - 1]); locate[x].pop_back();}
	} locate[x] = cur;
}

void solve() { int n; cin >> n;
    for (int i = 1; i <= 3; i++) {
        for (int j = 1; j <= n; j++) {
            int x; cin >> x; arr[i].pb(x);
            locate[x].pb({i, j});
        }
    }
    
    int empty = n + 1;
    for (int i = 1; i <= n; i++) {
    	for (int x = 1; x <= n; x++) {
    		if (locate[x][0].se == locate[x][1].se && locate[x][1].se == locate[x][0].se) continue;
    		sort(locate[x].begin(), locate[x].end()); bool anymove = false;
    		int a = locate[x][0].se, b = locate[x][1].se, c = locate[x][2].se;
    		if (locate[x][0].fi == 1 && locate[x][1].fi == 1 && locate[x][2].fi == 2) {
    			int a = locate[x][0].se, b = locate[x][1].se, c = locate[x][2].se;
    			swap(a, empty); swap(b, empty);
    			if (a == c) {
    				swap(c, empty);
    				swap(c, b);
				} else if (b == c) {
					swap(c, empty);
					swap(c, a);
				} else {
					swap(c, a);
					swap(c, empty);
					swap(c, b);
				} empty = c; 
				anymove = true;
			} else if (locate[x][0].fi == 1 && locate[x][1].fi == 2 && locate[x][2].fi == 2) {
				int a = locate[x][0].se, b = locate[x][1].se, c = locate[x][2].se;
				swap(a, empty);
				if (a == b) {
					swap(b, empty);
					swap(c, a);
					swap(c, empty);
					swap(c, a);
					empty = c;
				} else if (a == c) {
					swap(c, empty);
					swap(b, a);
					swap(b, empty);
					swap(b, a);
					empty = b;
				} else {
					swap(b, a);
					swap(b, empty);
					swap(c, b);
					swap(c, empty);
					swap(c, b);
					empty = c;
				} anymove = true;
			} else if (locate[x][0].fi == 1 && locate[x][1].fi == 2 && locate[x][2].fi == 3) {
				int a = locate[x][0].se, b = locate[x][1].se, c = locate[x][2].se;
				if (b == c) {
					swap(c, empty);
					swap(a, c);
					swap(empty, a);
				} else if (a == b) {
					swap(a, empty);
					swap(a, empty);
					swap(c, a);
					swap(c, a);
					swap(c, empty);
					empty = c;
				} else {
					swap(a, empty);
					swap(b, a);
					swap(b, empty);
					swap(c, b);
					swap(c, b);
					swap(c, empty);
					empty = c;
				} anymove = true;
			} else if (locate[x][0].fi == 1 && locate[x][1].fi == 1 && locate[x][2].fi == 1) {
				int a = locate[x][0].se, b = locate[x][1].se, c = locate[x][2].se;
				swap(a, empty); swap(b, empty); swap(c, empty);
				swap(a, b); swap(a, c); empty = a; anymove = true;
			} else if (locate[x][0].fi == 1 && locate[x][1].fi == 1 && locate[x][2].fi == 3) {
				int a = locate[x][0].se, b = locate[x][1].se, c = locate[x][2].se;
				if (a == c) {
					swap(a, empty);
					swap(b, empty);
					swap(a, b);
					swap(a, empty);
					empty = a;
				} else if (b == c) {
					swap(b, empty);
					swap(a, empty);
					swap(b, a);
					swap(b, empty);
					empty = b;
				} else {
					swap(c, empty);
					swap(c, empty);
					swap(a, c);
					swap(b, c);
					swap(empty, a);
					swap(empty, b);
				} anymove = true;
			} if (anymove) break;
		} 
	}
	
	if (empty != n + 1) {
		swap(n + 1, empty);
		swap(n + 1, empty);
		swap(n + 1, empty);
	}
	
	cout << cnt nl;
	for (int i = 0; i < cnt; i++) {
		cout << res[i].fi sp << res[i].se nl;
	}
}

signed main() {
	ios_base::sync_with_stdio(NULL);
    cin.tie(nullptr); cout.tie(nullptr);
    int t = 1; while (t--) solve();
}