#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;
ll A[555][555];

map<ll,vector<int>> M;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	FOR(y,N) FOR(x,N) cin>>A[y][x];
	
	if(N<=3) {
		vector<int> V;
		FOR(i,N*N) V.push_back(i);
		do {
			int vis[N*N]={};
			int par=0;
			FOR(i,N*N) if(vis[i]==0) {
				x=i;
				while(vis[x]==0) {
					par^=1;
					vis[x]=1;
					x=V[x];
				}
				par^=1;
			}
			FOR(i,N*N) if(V[i]==0) {
				par^=i%N;
				par^=i/N;
			}
			if(par==0) {
				ll ret=0;
				FOR(i,N*N) ret+=V[i]*A[i/N][i%N];
				if(M.count(ret)) {
					cout<<"Yes"<<endl;
					FOR(y,N) {
						FOR(x,N) cout<<V[y*N+x]<<" ";
						cout<<endl;
					}
					V=M[ret];
					FOR(y,N) {
						FOR(x,N) cout<<V[y*N+x]<<" ";
						cout<<endl;
					}
					return;
				}
				M[ret]=V;
			}
		} while(next_permutation(ALL(V)));
		cout<<"No"<<endl;
	}
	else {
		assert(0);
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}