#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define rep(i,a,b) for (int i = a; i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define PB push_back
#define FS first
#define SD second
#define ary(k) array<int, k>
template<class A, class B> void cmx(A &x, B y) { x = max<A>(x, y);}
template<class A, class B> void cmn(A &x, B y) { x = min<A>(x, y);}
typedef pair<int, int> pii;
typedef vector<int> vi;
int n,f[99],a[99][99],z[99];
string s[99];
int C(int x,int y){
    return (x-1)*(n+1)+y;
}
int F(int x){
    return f[x]==x?x:f[x]=F(f[x]);
}
void D(int x,int y){
    if(x>n){
        for(int i=1;i<=n+1;i++)
            for(int j=1;j<=n+1;j++){
                int c=C(i,j);
                if(!(s[i][j]=='+'||s[i][j]-'0'==z[c]))
                    return;
            }
        for(int i=1;i<=n;i++,cout<<'\n')
            for(int j=1;j<=n;j++)
                cout<<(a[i][j]?"\\":"/");
        exit(0);
    }
    int X=x,Y=y+1;
    if(Y>n)
        Y-=n,X++;
    for(int _=0;_<=1;_++){
        a[x][y]=_;
        int u,v;
        if(_)
            u=C(x,y),v=C(x+1,y+1);
        else
            u=C(x,y+1),v=C(x+1,y);
        z[u]++,z[v]++;
        if(F(u)!=F(v)&&(s[x][y]=='+'||s[x][y]-'0'==z[C(x,y)])){
            int g[99]={};
            for(int i=1;i<=(n+1)*(n+1);i++)
                g[i]=f[i];
            f[F(v)]=F(u);
            D(X,Y);
            for(int i=1;i<=(n+1)*(n+1);i++)
                f[i]=g[i];
        }
        z[u]--,z[v]--;
    }
}
signed main() {
    //cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit);
    cin>>n;
    for(int i=1;i<=n+1;i++)
        cin>>s[i],s[i]=' '+s[i];
    for(int i=1;i<=(n+1)*(n+1);i++)
        f[i]=i;
    D(1,1);
}