#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

namespace po167{
    template <class T>
    struct seg_sum{
        int n;
        int seg_size;
        std::vector<T> seg;
        T e;
        //要素数、単位元 typeは+演算が定義されているもの
        seg_sum(int k,T e_in){
            e=e_in;
            n=k;
            seg_size=1;
            while(seg_size<n) seg_size*=2;
            seg.resize(seg_size*2-1);
            for(int i=0;i<seg_size*2-1;i++) seg[i]=e;
        }

        T sum_sub(int a,int b,int l,int r,int k){
            if(r<=a||b<=l) return e;
            if(a<=l&&r<=b) return seg[k];
            T X=sum_sub(a,b,l,(l+r)/2,k*2+1);
            T Y=sum_sub(a,b,(l+r)/2,r,k*2+2);
            return X+Y;
        }
        T sum(int a,int b){
            //assert(0<=a&&b<n);
            return sum_sub(a,b,0,seg_size,0);
        }
        T get(int index){
            assert(0<=index&&index<n);
            return seg[seg_size-1+index];
        }
        void insert(int index,T a){
            assert(0<=index&&index<n);
            int now_index=index+seg_size-1;
            seg[now_index]=a;
            while(now_index!=0){
                now_index-=1;
                now_index/=2;
                seg[now_index]=seg[now_index*2+1]+seg[now_index*2+2];
            }
        }
    };

//qのなかみは、0~nの順列の並び替えである必要がある
    long long inversion_permutation(std::vector<int> &q){
        int n=q.size();
        po167::seg_sum<int> S(n,0);
        long long ans=0;
        for(int i=0;i<n;i++){
            assert(0<=q[i]&&q[i]<n);
            assert(S.get(q[i])==0);
            ans+=S.sum(q[i],n);
            S.insert(q[i],1);
        }
        return ans;
    }
    template <class T>
//pのなかみは、重複ありで内容が同じならおけ
//比較ができる必要がある。
    long long inversion_vector(std::vector<T> &p){
        int n=p.size();
        std::vector<int> q(n);
        for(int i=0;i<n;i++) q[i]=i;
        sort(q.begin(),q.end(),[&](int l,int r){
            if(p[l]==p[r]) return l<r;
            return p[l]<p[r];
        });
        return inversion_permutation(q);
    }

}
using po167::inversion_permutation;
using po167::inversion_vector;
using po167::seg_sum;

void solve();
// CITRUS CURIO CITY / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N;
    cin >> N;
    vector A(N, vector<ll>(N));
    rep(i, 0, N) rep(j, 0, N) cin >> A[i][j];
    if (N < 4){
        vector<int> p(N * N);
        auto f = [&]() -> int {
            vector<int> q;
            rep(i, 0, N * N) if (p[i]) q.push_back(p[i] - 1);
            return (po167::inversion_permutation(q)) & 1;
        };
        rep(i, 0, N * N) p[i] = i;
        reverse(p.begin() + N, p.begin() + N * 2);
        auto base = f();
        map<ll, vector<int>> m;
        So(p);

        do{
            if (f() == base){
                ll val = 0;
                reverse(p.begin() + N, p.begin() + N + N);
                rep(i, 0, N) rep(j, 0, N) val += p[i * N + j] * A[i][j];
                reverse(p.begin() + N, p.begin() + N + N);
                if (m.count(val)){
                    cout << "Yes\n";
                    auto out = [&](vector<int> v) -> void {
                        reverse(v.begin() + N, v.begin() + N + N);
                        rep(i, 0, N){
                            rep(j, 0, N){
                                cout << v[i * N + j];
                                if (j + 1 == N) cout << "\n";
                                else cout << " ";
                            }
                        }
                    };
                    out(m[val]);
                    out(p);
                    return;
                }
                m[val] = p;
            }
        }while (next_permutation(all(p)));
        cout << "No\n";
        return;
    }
    ll Z = 12;
    vector<int> num;
    vector<ll> X;
    vector ans(N, vector<int>(N));
    vector<pair<int, int>> pos;
    rep(i, 0, N){
        if (i & 1){
            for (int j = N - 1; j >= 0; j--){
                ans[i][j] = i * N + j;
                if (ans[i][j] < Z) pos.emplace_back(i, j), num.push_back(ans[i][j]), X.push_back(A[i][j]);
            }
        }
        else{
            rep(j, 0, N){
                ans[i][j] = i * N + j;
                if (ans[i][j] < Z) pos.emplace_back(i, j), num.push_back(ans[i][j]), X.push_back(A[i][j]);
            }
        }
    }
    vector<int> p;
    auto f = [&]() -> int {
        vector<int> q;
        rep(i, 0, Z) if (p[i]) q.push_back(p[i] - 1);
        return (po167::inversion_permutation(q)) & 1;
    };
    p = num;
    auto base = f();
    unordered_map<ll, vector<int>> m;
    So(p);
    do{
        if (f() == base){
            ll val = 0;
            rep(i, 0, Z) val += X[i] * p[i];
            if (m.count(val)){
                cout << "Yes\n";
                auto out = [&](vector<int> v) -> void {
                    rep(i, 0, Z) ans[pos[i].first][pos[i].second] = v[i];
                    rep(i, 0, N) vec_out(ans[i]);
                };
                out(m[val]);
                out(p);
                return;
            }
            m[val] = p;
        }
    }while (next_permutation(all(p)));
    cout << "No\n";
    return;
}