#include <iostream>
#include <fstream>
using namespace std;

const int  add[7][7]={{0,1,2,3,4,5,6},{1,2,3,4,5,6,0},{2,3,4,5,6,0,1},{3,4,5,6,0,1,2},{4,5,6,0,1,2,3},{5,6,0,1,2,3,4},{6,0,1,2,3,4,5}};
const int  sub[7][7]={{0,1,2,3,4,5,6},{6,0,1,2,3,4,5},{5,6,0,1,2,3,4},{4,5,6,0,1,2,3},{3,4,5,6,0,1,2},{2,3,4,5,6,0,1},{1,2,3,4,5,6,0}};
const int  mul[7][7]={{0,0,0,0,0,0,0},{0,1,2,3,4,5,6},{0,2,4,6,1,3,5},{0,3,6,2,5,1,4},{0,4,1,5,2,6,3},{0,5,3,1,6,4,2},{0,6,5,4,3,2,1}};
const int divd[7][7]={{9,9,9,9,9,9,9},{0,1,2,3,4,5,6},{0,4,1,5,2,6,3},{0,5,3,1,6,4,2},{0,2,4,6,1,3,5},{0,3,6,2,5,1,4},{0,6,5,4,3,2,1}};

const int dt[]={-1,-1,-1, 0, 0, 0, 1, 1, 1};
const int ds[]={-1, 0, 1,-1, 0, 1,-1, 0, 1};

int main(){
	int a[225][225];
	int b[225],borig[225];
	int pos[225];

	int N;

	ifstream cin("J.txt");
	while(cin>>N && N){
		const int NN=N*N;
		for(int i=0;i<N;i++){
			for(int k=0;k<N;k++){
				cin>>b[i*N+k];
				pos[i*N+k]=i*N+k;
			}
		}
		memcpy(borig,b,sizeof(int)*NN);

		for(int i=0;i<N;i++){
			for(int k=0;k<N;k++){
				for(int t=0;t<N;t++){
					for(int s=0;s<N;s++){
						a[i*N+k][t*N+s]=0;
					}
				}

				for(int m=0;m<9;m++){
					int tt=(i+N+dt[m])%N;
					int ss=(k+N+ds[m])%N;
					
					a[i*N+k][tt*N+ss]=1;
				}
			}
		}

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

#if 0
			cout<<endl;
			for(int s=0;s<NN;s++){
				for(int k=0;k<NN;k++){
					cout<<a[s][k];
				}
				cout<<endl;
			}
#endif

			if(a[i][i]==0){
				for(int k=i+1;k<NN;k++){
					if(a[k][i]){
						swap(pos[i],pos[k]);
						swap(b[i],b[k]);
						for(int t=0;t<NN;t++){
							swap(a[i][t],a[k][t]);
						}
						break;
					}
				}
			}

			if(a[i][i]!=0){
				if(a[i][i]>=2){
					int n=a[i][i];
					for(int k=i;k<NN;k++){
						a[i][k]=divd[n][a[i][k]];
					}
					b[i]=divd[n][b[i]];
				}

				for(int k=i+1;k<NN;k++){
					if(a[k][i]==0)continue;

					int n=a[k][i];
					for(int s=i;s<NN;s++){
						a[k][s]=sub[mul[a[i][s]][n]][a[k][s]];
					}
					b[k]=sub[mul[b[i]][n]][b[k]];
				}
			}
		}

		for(int i=NN-1;i>=0;i--){
			for(int k=0;k<i;k++){
				int n=a[k][i];
				a[k][i]=0;
				b[k]=sub[mul[b[i]][n]][b[k]];
			}
		}

	//check ok or not
	
		bool fail=0;
		int chk[15][15];
		memset(chk,0,sizeof(chk));

		for(int t=0;t<N;t++){
			for(int s=0;s<N;s++){
				if(b[t*N+s]==9)fail=1;

				for(int p=0;p<9;p++){
					int tt=(t+N+dt[p])%N;
					int ss=(s+N+ds[p])%N;

					chk[tt][ss]+=b[t*N+s];
				}
			}
		}

#if 0
			cout<<endl;
			for(int s=0;s<N;s++){
				for(int k=0;k<N;k++){
					cout<<borig[s*N+k];
				}
				cout<<" ";
				for(int k=0;k<N;k++){
					cout<<chk[s][k]%7;
				}
				cout<<endl;
			}
#endif

		for(int t=0;t<N;t++){
			for(int s=0;s<N;s++){
				if(chk[t][s]%7 != borig[t*N+s])fail=1;
			}
		}

	//output
		if(fail)cout<<-1<<endl;
		else{
			for(int i=0;i<N;i++){
				for(int k=0;k<N;k++){
					cout<<b[i*N+k]<<(k==N-1?'\n':' ');
				}
			}
		}

		cout<<endl;
	}

	return 0;
}