/*Sudoku Solver

By Raymond Le Grand

*/

#include<iostream>
#include<vector>

#define SIZE 9
#define SUM9 (9+8+7+6+5+4+3+2+1)

using namespace std;

int board[SIZE][SIZE];

bool ispossible(int n, int x, int y){
  //ck horizontally and vertically
  for (int i=0;i<SIZE;i++){
    if (board[i][y]==n) return false;
  }      
  for (int j=0;j<SIZE;j++){
    if (board[x][j]==n) return false;
  } 
   
  //ck square
  x=x/3;
  y=y/3;
  for (int i=3*x;i<(3*x+3);i++){
    for (int j=3*y;j<(3*y+3);j++){
      if (board[i][j]==n) return false;
    }
  }
  return true;
}

bool solveBoard(){  
  //find what numbers haven't been used and ck to see if soln's found
  int ckRow[SIZE];
  int ckCol[SIZE];
  int count,n;

  //ck rows
  for (int i=0;i<SIZE;i++){
    count=0;
    for (int j=0;j<SIZE;j++)
      count+=board[i][j]; 
    //Is row correct?
    ckRow[i]=0;
    if (count==SUM9) ckRow[i]=1;
  }

  //ck cols
  for (int j=0;j<SIZE;j++){
    count=0;
    for (int i=0;i<SIZE;i++)
      count+=board[i][j];
    //Is col correct?
    ckCol[j]=0;
    if (count==SUM9) ckCol[j]=1;
  }
  //ck each box
  int x,y;
  int box,ckBox;
  ckBox=0;
  for (x=0;x<3;x++){
    for (y=0;y<3;y++){
      //start of new box;
      box=0;
      for (int i=3*x;i<(3*x+3);i++){
	for (int j=3*y;j<(3*y+3);j++){
	  box+=board[i][j];
	}
      }
      //1 box has been checked, so see if it adds up;
      if (box==SUM9) ckBox+=1;
    }
  }

  //ck if total soln found
  count=0;
  for (n=0;n<SIZE;n++){
    count+=ckCol[n]+ckRow[n];
  }
  //count+=ckBox;
  //if row, col, and boxes are done, then whole puzzle is done
  if (count==(SIZE*2)) return true;


  vector<int> soln;
  //process possible solns
  for (int i=0;i<SIZE;i++){
    for (int j=0;j<SIZE;j++){
      if (board[i][j]==0){
	for (int n=1;n<=9;n++){
	  if (ispossible(n,i,j)){
	    //stick number in the vector
	    soln.push_back(n);
	  }
	}
	while (soln.size()>0){
	  board[i][j]=soln.back();
	  soln.pop_back();
	  if (solveBoard()==true) return true;
	  //that doesn't work, so try different number
	  board[i][j]=0;
	}
	return false;
      }
    }
  }
  return false;    

}

int main(){
  int num,flag;
  flag=0;

  while(true){
 
    //read in 1 puzzle
    for (int i=0;i<9;i++){
      for (int j=0;j<9;j++){
	cin>>num;
	board[i][j]=num;
      }
    }
    if (cin.eof()) break;
    if (flag!=0) cout<<endl;
    flag++;
    solveBoard();
    for (int i=0;i<SIZE;i++){
      for (int j=0;j<SIZE;j++){
	cout<<board[i][j];
	if (j+1<SIZE) cout<<' ';
      }
      cout<<endl;
    }
  }
  return 0;
}