#include <cstdio>
#include <vector>
using namespace std;

typedef vector<int> V;
typedef vector<V> M;

#define N 50
#define MOD 7
int n,mod,g[N][N];

#define mul(a,b) ((((a)%MOD)*((b)%MOD))%MOD)
#define sub(a,b) ((((a)%MOD)-((b)%MOD)+MOD)%MOD)

int msolve(int a)
{
  int c=a,d=MOD,e=1,f=0,q,r;
  int tmp;
  
  while (r=c%d) {
    q=c/d;
    c=d;
    d=r;
    tmp=f;
    f=e-q*f;
    e=tmp;
  }
  q=(f/d)%(MOD/d);
  if (q<0) q+=MOD/d;
  return q;
}

int gauss(M& a, V& b, V& x) 
{
  int m=a.size(),n=a[0].size(),k,r;
  vector<int> q;
  for (k=0;k<min(m,n);++k) {
    int i,j;
    for(j=k;j<n;j++)
      for(i=k;i<m;i++)
        if (abs(a[i][j])>0) goto FOUND;
    break;
  FOUND:
    if (j!=k) for (int t=0;t<m;++t) swap(a[t][j], a[t][k]);
    q.push_back(j);
    if (i!=k) { swap(a[i],a[k]); swap(b[i],b[k]); }
    for (int j=k+1;j<m;++j)
      if (a[j][k]!=0) {
        int l=mul(a[j][k],msolve(a[k][k]));
        for (int i=k+1;i<n;++i) a[j][i]=sub(a[j][i],mul(l,a[k][i]));
        b[j]=sub(b[j],mul(l,b[k]));
      }
  }
  r=k;
  x.clear(); x.resize(n,0);
  for (int k=r;k<m;++k) if (abs(b[k])>0) return -1;
  for (int k=r-1;k>=0;--k) {
    int s=b[k];
    for (int j=k+1;j<r;++j) s=sub(s,mul(a[k][j],x[j]));
    x[k]=mul(s,msolve(a[k][k]));
  }
  for (int k=r-1;k>=0;--k) swap(x[k], x[q[k]]);
  return n-r;
}

int enc(int x, int y) {
  return y*n+x;
}

int main() {
  while(scanf("%d",&n),n) {
    if (n<3||n>15) {
      fprintf(stderr,"invalid input\n");
      exit(0);
    }
    M a(n*n,V(n*n));
    V b(n*n),ans;

    for (int y=0;y<n;++y)
      for (int x=0;x<n;++x) {
	int v; 
	scanf("%d",&v);
	b[enc(x,y)]=v;
      }

    for (int y=0;y<n;++y)
      for (int x=0;x<n;++x) 
	for (int dy=-1;dy<=1;++dy) 
	  for (int dx=-1;dx<=1;++dx) {
	    int px=(x+dx+n)%n,py=(y+dy+n)%n;
	    a[enc(x,y)][enc(px,py)]=1;
	  }
    int r=gauss(a,b,ans);
    if (r==-1) {
      puts("-1");
    } else {
      for (int y=0;y<n;++y) {
	for (int x=0;x<n;++x) {
	  if (x) putchar(' ');
	  printf("%d",ans[enc(x,y)]);
	}
	puts("");
      }
    }
    puts("");
  }
}