import java.util.*;

public class c {
    static int n;
    static char[][] input;
    static char[][] answer;
    
    static int countIngoing(int i, int j) {
        int result = 0;
        if (i < n && j < n && answer[i][j] == '\\') result += 1;
        if (i > 0 && j < n && answer[i - 1][j] == '/') result += 1;
        if (i < n && j > 0 && answer[i][j - 1] == '/') result += 1;
        if (i > 0 && j > 0 && answer[i - 1][j - 1] == '\\') result += 1;

        return result;
    }

    static int countPerpendicular(int i, int j) {
        int result = 0;
        if (i < n && j < n && answer[i][j] == '/') result += 1;
        if (i > 0 && j < n && answer[i - 1][j] == '\\') result += 1;
        if (i < n && j > 0 && answer[i][j - 1] == '\\') result += 1;
        if (i > 0 && j > 0 && answer[i - 1][j - 1] == '/') result += 1;

        return result;
    }

    static int countUnknown(int i, int j) {
        int result = 0;
        if (i < n && j < n && answer[i][j] == 0) result += 1;
        if (i > 0 && j < n && answer[i - 1][j] == 0) result += 1;
        if (i < n && j > 0 && answer[i][j - 1] == 0) result += 1;
        if (i > 0 && j > 0 && answer[i - 1][j - 1] == 0) result += 1;

        return result;
    }

    static boolean verify() {
        for (int i = 0; i <= n; ++i) {
            for (int j = 0; j <= n; ++j) {
                if (input[i][j] == '+') continue;
                int expected = input[i][j] - '0';
                int ingoing = countIngoing(i, j);
                int perpen = countPerpendicular(i, j);
                int unknown = countUnknown(i, j);
                if (ingoing > expected) return false;
                if (ingoing + unknown < expected) return false;
            }
        }

        ArrayDeque<Integer> iq = new ArrayDeque<>();
        ArrayDeque<Integer> jq = new ArrayDeque<>();
        boolean[][] visited = new boolean[n + 1][n + 1];
        int[][] ipar = new int[n + 1][n + 1];
        int[][] jpar = new int[n + 1][n + 1];
        for (int[] arr : ipar) Arrays.fill(arr, -1);
        for (int[] arr : jpar) Arrays.fill(arr, -1);
        for (int u = 0; u <= n; ++u) {
            for (int v = 0; v <= n; ++v) {
                if (visited[u][v]) continue;
                iq.add(u);
                jq.add(v);
                visited[u][v] = true;
                while (!iq.isEmpty()) {
                    int i = iq.poll();
                    int j = jq.poll();
                    ArrayList<Integer> ni = new ArrayList<>();
                    ArrayList<Integer> nj = new ArrayList<>();
                    if (i < n && j < n && answer[i][j] == '\\') { ni.add(i + 1); nj.add(j + 1); }
                    if (i > 0 && j < n && answer[i - 1][j] == '/') { ni.add(i - 1); nj.add(j + 1); }
                    if (i < n && j > 0 && answer[i][j - 1] == '/') { ni.add(i + 1); nj.add(j - 1); }
                    if (i > 0 && j > 0 && answer[i - 1][j - 1] == '\\') { ni.add(i - 1); nj.add(j - 1); }
                    for (int index = 0; index < ni.size(); ++index) {
                        int ci = ni.get(index);
                        int cj = nj.get(index);
                        if (visited[ci][cj]) {
                            if (ipar[i][j] == ci && jpar[i][j] == cj) {
                                continue;
                            }
                            return false;
                        }
                        ipar[ci][cj] = i;
                        jpar[ci][cj] = j;
                        visited[ci][cj] = true;
                        iq.add(ci);
                        jq.add(cj);
                    }
                }
            }
        }

        return true;
    }

    static boolean solve(int i, int j) {
        if (!verify()) {
            return false;
        }
        
        if (i == n) {
            return true;
        }

        int ni = i, nj = j + 1;
        if (nj == n) {
            ni += 1;
            nj = 0;
        }

        answer[i][j] = '\\';
        if (solve(ni, nj)) return true;

        answer[i][j] = '/';
        if (solve(ni, nj)) return true;

        answer[i][j] = 0;
        return false;
    }
    
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        n = scan.nextInt();
        scan.nextLine();
        answer = new char[n][n];
        input = new char[n + 1][];
        for (int i = 0; i <= n; ++i) {
            input[i] = scan.nextLine().toCharArray();
        }

        solve(0, 0);

        for (char[] arr : answer) {
            System.out.println(String.valueOf(arr));
        }
    }
}