#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fore(i, l, r) for (ll i = (int)l; i <= (int)r; i++)
#define ford(i, r, l) for (ll i = (int)r; i >= (int)l; i--)
const int MAXN = 2123456LL;
ll T, n, a[52][52];
ll cnt = 0;
ll nxt()
{
    if (cnt == 2 * n)
        return cnt;
    return ++cnt;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    fore(i, n - 1, n)
    {
        fore(j, 1, 2)
        {
            a[i][j] = nxt();
        }
    }
    ll tmp = nxt();
    fore(i, 1, n - 2)
    {
        fore(j, 1, 2)
        {
            a[i][j] = tmp;
        }
    }
    fore(i, n - 1, n)
    {
        fore(j, 3, n)
        {
            a[i][j] = tmp;
        }
    }
    fore(i, 1, n - 2)
    {
        a[i][3] = nxt();
    }
    fore(j, 4, n)
    {
        a[n - 2][j] = nxt();
    }
    fore(i, 1, n - 3)
    {
        fore(j, 4, n)
        {
            a[i][j] = a[n - 2][j];
        }
    }
    if (cnt == 2 * n)
    {
        cout << "Yes" << endl;
        fore(i, 1, n)
        {
            fore(j, 1, n)
            {
                cout << a[i][j] << " ";
            }
            cout << endl;
        }
    }
    else
    {
        cout << "No" << endl;
    }

    return 0;
}