#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<iomanip>
#include<queue>
#include<algorithm>
#include<vector>
#include<stack>
#include<set>
using namespace std;
#define LL long long
const int N=100;
using namespace std;
int sd[11][11];
int flag = 0;
bool p[11][11], l[11][11], fz[11][11];
void _out()
{
	if(flag==3)
	{
		flag=0;
		cout<<endl;
	}
	for (int i = 1; i <= 3; i++)
	{
		for (int j = 1; j <= 3; j++)
			cout << sd[i][j] << " ";
		cout<<"  ";
		for (int j = 4; j <= 6; j++)
			cout << sd[i][j] << " ";
		cout<<" ";
		for (int j = 7; j <= 9; j++)
			cout <<" "<< sd[i][j];
		cout << endl;
	}
	cout<<endl;
	for (int i = 4; i <= 6; i++)
	{
		for (int j = 1; j <= 3; j++)
			cout << sd[i][j] << " ";
		cout<<"  ";
		for (int j = 4; j <= 6; j++)
			cout << sd[i][j] << " ";
		cout<<" ";
		for (int j = 7; j <= 9; j++)
			cout << " "<< sd[i][j] ;
		cout << endl;
	}
	for (int i = 7; i <= 9; i++)
	{
		cout<<endl;
		for (int j = 1; j <= 3; j++)
			cout << sd[i][j] << " ";
		cout<<"  ";
		for (int j = 4; j <= 6; j++)
			cout << sd[i][j] << " ";
		cout<<" ";
		for (int j = 7; j <= 9; j++)
			cout << " "<< sd[i][j] ;
	}
	flag++;
	exit(0);
}
void dfs(int x, int y)
{
	if (sd[x][y] != 0)
		if (x == 9 && y == 9)_out();
		else if (y == 9)dfs(x + 1, 1);
		else dfs(x, y + 1);
	else
		for (int i = 1; i <= 9; i++)
			if ((!p[x][i]) && (!l[y][i]) && (!fz[(x - 1) / 3 * 3 + (y - 1) / 3 + 1][i]))

			{
				sd[x][y] = i;
				p[x][i] = l[y][i] = fz[(x - 1) / 3 * 3 + (y - 1) / 3 + 1][i] = true;
				if (x == 9 && y == 9)_out();
				else if (y == 9)dfs(x + 1, 1);
				else dfs(x, y + 1);
				sd[x][y] = 0;
				p[x][i] = l[y][i] = fz[(x - 1) / 3 * 3 + (y - 1) / 3 + 1][i] = false;
			}
}
int main()
{
	for (int i = 1; i <= 9; i++)
		for (int j = 1; j <= 9; j++)
		{
			int t;
			cin >> t;
			if (t != 0)
				p[i][t] = l[j][t] = fz[(i - 1) / 3 * 3 + (j - 1) / 3 + 1][t] = true;

			sd[i][j] = t;
		}
	dfs(1, 1);
	return 0;
}