#include <bits/stdc++.h>
using namespace std;
const int N=9,M=9;
int grid[N][M];
int vis[N][M];
/****
53..7....
6..195...
.98....6.
8...6...3
4..8.3..1
7...2...6
.6....28.
...419..5
....8..79
***/
void init()
{
    int i,j;
    char ch;
    for(i=0;i<N;i++){
        for(j=0;j<M;j++){
            ch=getchar();
            if(ch!='.'){
                grid[i][j]=ch-'0';
            }
        }
        getchar();
    }
    for(i=0;i<N;i++){
        for(j=0;j<M;j++){
            printf("%d ",grid[i][j]);
        }
        printf("\n");
    }
    printf("\n");
}
bool check_bound()
{

}
void dfs(int n,int m,int num)
{

    printf("debug\n");
    return ;
}

int main()
{
    memset(grid,-1,sizeof(grid));
    memset(vis,-1,sizeof(vis));
    init();
    dfs(vis);
    return 0;
}