#include <bits/stdc++.h>
#define pb push
#define INF 0x3f3f3f3
#define LINF 0x3f3f3f3f3f3f3f
#define MAXN int(2000005)
#define fim '\n'
#define ll long long
#define f first
#define s second
#define FAST ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define debug(x) cout << "DEBUG " << x << fim
#define debug2(x, y) cout << "DEBUG " << x << " " << y << fim
#define debug3(x, y, z) cout << "DEBUG " << x << " " << y << " " << z<< fim
#define max3(x, y, z) max(x, max(y, z))
using namespace std;
typedef pair<ll, int> pii;
typedef pair<string, int> psi;
typedef pair<int, pair<int, int> > piii;
typedef pair<char, int> pci;
typedef pair<int, bool> pib;
ll MOD = 1000000007;

int n;
char m[1005][1005];
int x[] = {1, -1, 0, 0};
int y[] = {0, 0, 1, -1};

int dfs(int i, int j, char cont) {
    if(m[i][j] != '*') m[i][j] = min(cont, m[i][j]);
    else m[i][j] = cont;
    for(int z = 0; z < 4; z++) {
        int a = i + x[z], b = j + y[z];
        if(a < 0 or a > n or b < 0 or b > n or m[a][b] == '0') continue;
        if(m[a][b] == '*' or m[a][b] > cont+1) dfs(a, b, cont+1);
    }
}

int main() {
    FAST;
    cin >> n;
    for(int i = 0; i < n; i++)
        for(int j = 0; j < n; j++)
            cin >> m[i][j];

    for(int i = 0; i < n; i++)
        for(int j = 0; j < n; j++)
            if(m[i][j] == '0') dfs(i, j, '0');

    for(int i = 0; i < n; cout << endl, i++)
        for(int j = 0; j < n; j++)
            cout << m[i][j];

}