#include<bits/stdc++.h>

#define pb push_back
#define fi first
#define se second

//typedef long long ll;
//#define int ll

using namespace std;

int a[2020][2020];
int cnt[2020*2020*4];

const int M = 12;
const int FULL = (1<<M) - 1;
const int FULL2 = (1<<(2*M)) - 1;
vector<int> submasks[1<<M];
vector<int> upmasks[1<<M];
int okcnt[1<<M][1<<M];

main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    for (int i=0; i<(1<<M); i++)
        for (int j=0; j<=i; j++)
            if ((i&j) == j)
                submasks[i].pb(j), upmasks[j].pb(i);
    for (int i=0; i<(1<<M); i++)
        for (int j=0; j<(1<<M); j++)
            okcnt[i][j]=submasks[j].size();

    int n;
    cin>>n;

    int mnk = 0;
    for (int i=1; i<=n; i++)
        for (int j=1; j<=n; j++)
    {
        while (cnt[mnk] == 5)
            mnk++;
        bool ok = false;
        int mask = FULL2 - (a[i][j-1] | a[i-1][j]);

//        random_shuffle(submasks[mask>>M].begin(), submasks[mask>>M].end());
        for (int k1 : submasks[mask>>M])
        {
//            if ((k1<<M) < 4*n*n)
            if (okcnt[k1][mask&FULL] == 0)
            {
//                cout<<"otsek"<<endl;
                continue;
            }
            for (int k2 : submasks[mask&FULL])
            {
                int k = (k1<<M) + k2;
                if (k >= 4*n*n)
                {
                    continue;
                }
                if (cnt[k] < 5)
                {
                    a[i][j] = k;
                    cnt[k]++;
                    if (cnt[k] == 5)
                    {
                        for (int i : upmasks[k2])
                            okcnt[k1][i]--;
                    }
                    ok = true;
                    break;
                }
            }
            if (ok)
                break;
        }
        if (!ok)
            cout<<"WA "<<i<<" "<<j<<"\n", exit(1);
    }
    cout<<"Yes\n";
    for (int i=1; i<=n; i++, cout<<"\n")
        for (int j=1; j<=n; j++)
            cout<<a[i][j]<<" ";
}