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


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    int sz = (n + 1) * (n + 1);
    vector<int> arr(sz);
    for (int i = 0; i <= n; i++) {
        for (int j = 0; j <= n; j++) {
            char c;
            cin >> c;
            if (c == '+') {
                arr[i * (n + 1) + j] = -1;
            } else {
                arr[i * (n + 1) + j] = c - '0';
            }
        }
    }
    string sol = "";
    queue<string> q;
    q.push("0");
    q.push("1");
    while(q.size() > 0) {
        int i = q.front().size() - 1;
        int row = i / n;
        int col = i % n;
        int tl = row * (n + 1) + col;
        int tr = tl + 1;
        int bl = tl + n + 1;
        int br = bl + 1;
        vector<int> count(br + 1);
        vector<vector<int>> graph(br + 1);
        for (int i = 0; i < q.front().size() - 1; i++) {
            int row = i / n;
            int col = i % n;
            int tl = row * (n + 1) + col;
            int tr = tl + 1;
            int bl = tl + n + 1;
            int br = bl + 1;
            if (q.front()[i] == '0') {
                count[tl]++;
                count[br]++;
                graph[tl].push_back(br);
                graph[br].push_back(tl);
            } else {
                count[tr]++;
                count[bl]++;
                graph[tr].push_back(bl);
                graph[bl].push_back(tr);
            }
        }
        if (q.front()[i] == '0') {
            count[tl]++;
            count[br]++;
        } else {
            count[tr]++;
            count[bl]++;
        }
        if (arr[tl] != -1 && count[tl] != arr[tl]) {
            q.pop();
            continue;
        }
        if (arr[tr] != -1 && count[tr] > arr[tr]) {
            q.pop();
            continue;
        }
        if (arr[bl] != -1 && count[bl] > arr[bl]) {
            q.pop();
            continue;
        }
        if (arr[br] != -1 && count[br] > arr[br]) {
            q.pop();
            continue;
        }
        if (col == n - 1 && arr[tr] != -1 && count[tr] != arr[tr]) {
            q.pop();
            continue;
        }
        if (row == n - 1 && arr[bl] != -1 && count[bl] != arr[bl]) {
            q.pop();
            continue;
        }
        if (q.front()[i] == '1') {
            queue<int> bfs;
            vector<int> vis(sz);
            vis[bl] = 1;
            bfs.push(bl);
            while(bfs.size() > 0) {
                for (int node : graph[bfs.front()]) {
                    if (vis[node] == 0) {
                        bfs.push(node);
                        vis[node] = 1;
                    }
                }
                bfs.pop();
            }
            if (vis[tr] == 1) {
                q.pop();
                continue;
            }
        }
        if (q.front().size() == n * n) {
            if (arr[tr] != -1 && count[tr] != arr[tr]) {
                q.pop();
                continue;
            }
            if (arr[bl] != -1 && count[bl] != arr[bl]) {
                q.pop();
                continue;
            }
            if (arr[br] != -1 && count[br] != arr[br]) {
                q.pop();
                continue;
            }
            sol = q.front();
            break;
        }
        q.push(q.front() + '0');
        q.push(q.front() + '1');
        q.pop();
    }
    if (sol.size() < n * n) {
        cout << sol.size() << "\n";
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (sol[i * n + j] == '0') {
                cout << "\\";
            } else {
                cout << "/";
            }
        }
        cout << "\n";
    }

}