#include <bits/stdc++.h>

void charming() {
  int n; std::cin >> n;
  std::vector<std::vector<int> > a(n, std::vector<int> (n));
  a[0][0] = 1, a[0][1] = 2, a[1][0] = 3, a[1][1] = 4;
  int c = 5;
  for (int i = 2; i < n; ++i) {
    for (int j = 0; j < i; ++j) {
      a[i][j] = a[j][i] = c;
    }
    a[i][i] = ++c;
    ++c;
  }

  std::cout << "Yes\n";
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      std::cout << a[i][j] << " \n"[j == n - 1];
    }
  }
}

signed main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(NULL);
  std::cout.tie(NULL);
  charming();
  return 0;
}