package test1;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import static test1.Main.map;

public final class Main {
    static Pair[][] map = new Pair[7][5];
    static {
        map[0][0] = new Pair(0,-1);  map[0][1] = new Pair(0,-1);  map[0][2] = new Pair(1,-1);  map[0][3] = new Pair(1,-1);  map[0][4] = new Pair(2,-1);
        map[1][0] = new Pair(0,-1);  map[1][1] = new Pair(0,-1);  map[1][2] = new Pair(1,-1);  map[1][3] = new Pair(1,-1);  map[1][4] = new Pair(0,-1);
        map[2][0] = new Pair(2,-1);  map[2][1] = new Pair(1,-1);  map[2][2] = new Pair(1,-1);  map[2][3] = new Pair(0,-1);  map[2][4] = new Pair(0,-1);
        map[3][0] = new Pair(1,-1);  map[3][1] = new Pair(1,-1);  map[3][2] = new Pair(1,-1);  map[3][3] = new Pair(0,-1);  map[3][4] = new Pair(0,-1);
        map[4][0] = new Pair(2,-1);  map[4][1] = new Pair(1,-1);  map[4][2] = new Pair(1,-1);  map[4][3] = new Pair(2,-1);  map[4][4] = new Pair(1,-1);
        map[5][0] = new Pair(0,-1);  map[5][1] = new Pair(0,-1);  map[5][2] = new Pair(1,-1);  map[5][3] = new Pair(1,-1);  map[5][4] = new Pair(1,-1);
        map[6][0] = new Pair(0,-1);  map[6][1] = new Pair(0,-1);  map[6][2] = new Pair(2,-1);  map[6][3] = new Pair(2,-1);  map[6][4] = new Pair(2,-1);
    }
    static Map<Integer, ArrayList<int[]>> squares = new HashMap<>();
    static class Pair {
        public int type;
        public int color;
        public static int nextColor = 10;

        public Pair(int type, int color) {
            this.type = type;
            this.color = color;
        }

        public String showType() {
            return this.type+"";
        }
        public String showColor() {
            return this.color+"";
        }
    }
    void solve() {
        int[] proj = new int[map[0].length];
        Arrays.fill(proj, -1); int len = 0;
        for (int i = 0; i < map.length; i++) {
            boolean canDown = false; int projFlag = -1;
            for (int j = 0; j < map[0].length; j++) {
                int type = map[i][j].type;
                if (type != 0) {
                    if (i == 4) {
                        System.out.println();
                    }
                    if (proj[j] != -1) {
                        projFlag = j;
                        if (j > 0 && proj[j - 1] == proj[j]) {
                            len++;
                        } else {
                            len = 0;
                        }
                        map[i][j].color = map[i - 1][j].color;
                    } else if (((j > 0) && (map[i][j - 1].type == type)) && (projFlag != j - 1)) {
                        map[i][j].color = map[i][j - 1].color;
                        len++;
                    } else {
                        map[i][j].color = ++Pair.nextColor;
                        len = 0;
                    }
                    canDown = (i < (map.length - 1) && (map[i + 1][j].type == type)) ? true : false;
                    if (canDown) {
                        proj[j] = map[i][j].color;
                    } else {
                        int tmp = len;
                        while (tmp >= 0) {
                            proj[j - tmp] = -1;
                            tmp--;
                        }
                    }
                }
            }
        }
    }
    Main() {
        printTypes(map);
        System.out.println();
        solve();
        printColor(map);
    }
    public static void main(String[] args) { new Main(); }
    void printTypes(Pair[][] array) {
        for (Pair[] row : array) {
            for (Pair somePair : row) {
                System.out.print(somePair.showType() + " ");
            }
            System.out.println();
        }
    }
    void printColor(Pair[][] array) {
        for (Pair[] row : array) {
            for (Pair somePair : row) {
                System.out.print(somePair.showColor() + " ");
            }
            System.out.println();
        }
    }
}