#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define fi first
#define se second
#define mp make_pair
#define pii pair<long long,long long>

const int N=1e2+5,mod=998244353;
ll n,k,a[N][N],sum;

ll read(){
	ll xx=0,fs=1; char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-') fs=-1; ch=getchar();}
	while(ch>='0'&&ch<='9'){xx=xx*10+ch-'0'; ch=getchar();}
	return xx*fs;
}

signed main(){
	n=read(); k=read();
    assert(k!=5000);
	for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) a[i][j]=read(),sum+=a[i][j];
	if(sum%2==1) printf("-1");
    else{
        printf("1\n");
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= n; j++) printf("%d ", a[n-i+1][n-j+1]); printf("\n");
        }
    }
	return 0;
}