#include <cstdio>
#include <iostream>
#include <deque>
using namespace std;
struct huan {
    int x1, x2, y1, y2;
};
struct map {
    int s[6][6];
    deque<huan> ans;
};
deque<map> maps;
int f[66000], aim;
map qi, a;
int zhuan() {
    int i, j, ans = 0, t = 1;
    for (i = 1; i <= 4; i++) {
        ans += t * (a.s[i][1] * 8 + a.s[i][2] * 4 + a.s[i][3] * 2 + a.s[i][4]);
        t *= 16;
    }
    return ans;
}
void print() {
    int i, n = a.ans.size();
    printf("%d\n", n);
    for (i = 0; i < n; i++) printf("%d%d%d%d\n", a.ans[i].x1, a.ans[i].y1, a.ans[i].x2, a.ans[i].y2);
}
void bfs() {
    int i, j, k, n, w;
    huan t;
    while (1) {
        n = maps.size();
        for (k = 0; k < n; k++) {
            for (i = 1; i <= 4; i++)
                for (j = 1; j <= 4; j++) {
                    if (i < 4) {
                        a = maps[0];
                        t.x1 = i;
                        t.y1 = j;
                        t.x2 = i + 1;
                        t.y2 = j;
                        a.ans.push_back(t);
                        w = a.s[i][j];
                        a.s[i][j] = a.s[i + 1][j];
                        a.s[i + 1][j] = w;
                        w = zhuan();
                        if (w == aim) {
                            print();
                            return;
                        }
                        if (f[w] == 0) {
                            f[w] = 1;
                            maps.push_back(a);
                        }
                    }
                    if (j < 4) {
                        a = maps[0];
                        t.x1 = i;
                        t.y1 = j;
                        t.x2 = i;
                        t.y2 = j + 1;
                        a.ans.push_back(t);
                        w = a.s[i][j];
                        a.s[i][j] = a.s[i][j + 1];
                        a.s[i][j + 1] = w;
                        w = zhuan();
                        if (w == aim) {
                            print();
                            return;
                        }
                        if (f[w] == 0) {
                            f[w] = 1;
                            maps.push_back(a);
                        }
                    }
                }
            maps.pop_front();
        }
    }
}
int main() {
    int i, t = 1;
    char s[6];
    for (i = 1; i <= 4; i++) {
        scanf("%s", s + 1);
        qi.s[i][1] = s[1] - 48;
        qi.s[i][2] = s[2] - 48;
        qi.s[i][3] = s[3] - 48;
        qi.s[i][4] = s[4] - 48;
    }
    for (i = 1; i <= 4; i++) {
        scanf("%s", s + 1);
        aim += t * ((s[1] - 48) * 8 + (s[2] - 48) * 4 + (s[3] - 48) * 2 + s[4] - 48);
        t *= 16;
    }
    maps.push_back(qi);
    bfs();
    return 0;
}