#include<bits/stdc++.h>
using namespace std;
int a[10][10],flag;
bool h[10][10],l[10][10],g[10][10];
int f[9][9]={
    1,1,1,2,2,2,3,3,3,
    1,1,1,2,2,2,3,3,3,
    1,1,1,2,2,2,3,3,3,
    4,4,4,5,5,5,6,6,6,
    4,4,4,5,5,5,6,6,6, 
    4,4,4,5,5,5,6,6,6,
    7,7,7,8,8,8,9,9,9,
    7,7,7,8,8,8,9,9,9,
    7,7,7,8,8,8,9,9,9
};	
int dfs(int k){
	if(flag ==1)return 0;
	if(k>80){
		for(int i=0;i<9;i++){
			for(int j=0;j<9;j++){
				cout<<a[i][j]<<" ";
			}
			cout<<endl;
		}
		flag=1;
		return 0;
	}
	 int x=k/9;
	 int y=k%9;
	 if(a[x][y]!=0){
	 	dfs(k+1);
	 }else{
	 	for(int i=1;i<=9;i++){
	 		if(h[x][i]==0&&l[y][i]==0&&g[f[x][y]][i]==0){
	 			h[x][i]=1;
	 			l[y][i]=1;
	 			g[f[x][y]][i]=1;
	 			a[x][y] =i;
	 			dfs(k+1);
	 			h[x][i]=0;
	 			l[y][i]=0;
	 			g[f[x][y]][i]=0;
	 			a[x][y] =0;
			 }
		 }
	 }
	 return 0;
}
int main(){
	for(int i=0;i<9;i++){
		for(int j=0;j<9;j++){
			cin>>a[i][j];
			int x=a[i][j];
			h[i][x]=1;
			l[j][x]=1;
			g[f[i][j]][x]=1;
		}
	}
	dfs(0);
	return 0;
}