#include<iostream>

#include<algorithm>

#include<string>

using namespace std;

int m[10][10],kx[10][10],ky[10][10],kk[10][10];		//kx：行 ky：列 kk：方格

int ans;

void dfs(int x, int y) {

	if (ans)return;

	if (x == 9) {

		ans = 1;

		for (int i = 0; i < 9; i++) {

			for (int j = 0; j < 9; j++)

				cout << m[i][j];

		}

		cout << "\n";

	}

	if (m[x][y] == 0) {

		for (int i = 1; i < 10; i++) {

			if (kx[x][i]==0&&ky[y][i]==0&& kk[3 * (x / 3) + (y / 3)][i]==0) {

				kx[x][i] = 1;

				ky[y][i] = 1;

				kk[3 * (x/3) + (y/3)][i] = 1;

				m[x][y] = i;

				if (y == 8)dfs(x + 1,0);

				else dfs(x, y + 1);

				kx[x][i] = 0;

				ky[y][i] = 0;

				kk[3 * (x / 3) + (y / 3)][i] = 0;

				m[x][y] = 0;

			}

		}

		return;

	}

	else {

		if (y == 8)dfs(x + 1, 1);

		else dfs(x, y + 1);

	}

}

int main() {

	ios::sync_with_stdio(0);

	cin.tie(0),cout.tie(0);

	string a;

	while (cin >> a&&a[0] != 'e') {

		memset(m, 0, sizeof(m));

		memset(kx, 0, sizeof(kx));

		memset(ky, 0, sizeof(ky));

		memset(kk, 0, sizeof(kk));

		ans = 0;

		int len = a.size();

		for (int i = 0; i < len; i++)

		{

			if (a[i] != '.') {

				m[i / 9][i % 9] = a[i] - '0';		//终于把地图做好了。。

				kx[i / 9][a[i] - '0'] = 1;

				ky[i % 9][a[i] - '0'] = 1;

				kk[3 * (i / 9 / 3) + (i % 9 / 3)][a[i] - '0'] = 1;		//初始化

			}

		}

		dfs(0, 0);

	}

	return 0;

}