#include <bits/stdc++.h>
using namespace std;

namespace SOL {

using i64 = long long;
void debug(const char *msg, ...) {
#ifdef CLESIP
    va_list arg;
    static char pbString[512];
    va_start(arg,msg);
    vsprintf(pbString,msg,arg);
    cerr << "[DEBUG] " << pbString << "\n";
    va_end(arg);
#endif    
}
template<typename T, typename L>
bool chkmax(T &x, L y) { if (x < y) return x = y, true; return false; }
template<typename T, typename L>
bool chkmin(T &x, L y) { if (y < x) return x = y, true; return false; }

void solve() {
	int n; cin >> n;

	if (n & 1) {
		cout << "No\n";
		return;
	}

	cout << "Yes\n";
	vector<vector<int>> ans(n + 1, vector<int>(n + 1));
	for (int i = 1; i <= n / 2; i ++) {
		int a = n / 2;
		int b = i - 1;
		for (int j = 1; j <= a; j ++)
			ans[i][j] = 1;
		for (int j = 1; j <= b; j ++)
			ans[i][n / 2 + j] = -1;
	}
	for (int i = 1; i <= n / 2; i ++) {
		int a = n / 2 - i + 1;
		int b = n / 2;
		for (int j = 1; j <= a; j ++)
			ans[i + n / 2][j] = 1;
		for (int j = 1; j <= b; j ++)
			ans[i + n / 2][n / 2 + j] = -1;
	}
	for (int i = 1; i <= n; i ++)
		for (int j = 1; j <= n; j ++)
			cout << ans[i][j] << " \n"[j == n];
}

}
int main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	SOL::solve();
	return 0;
}