#include <bits/stdc++.h>
using namespace std;
int a[35][35];
int n;
void dfs(int x,int y)
{
	if (x<1||x>n||y<1||y>n) return;//判断越界
	else if(a[x+1][y]==1||a[x-1][y]==1||a[x][y+1]==1||a[x][y-1]==1) return;
	a[x][y]=0;
	dfs(x+1,y);
	dfs(x-1,y);
	dfs(x,y+1);
	dfs(x,y-1);
	return;
}
int main()
{
	scanf("%d",&n);
	for (int i=1;i<=n;i++)
	{
		for (int j=1;j<=n;j++)
		{
		scanf("%d",&a[i][j]);
		if (a[i][j]==0) a[i][j]=2;
		}
	}
	dfs(1,1);
	for (int i=1;i<=n;i++)
	{
		for (int j=1;j<=n;j++)
			cout<<a[i][j]<<' ';
		cout<<endl;
	}
	return 0;
}