$n$-Way Tie Gym

#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <set>#include <stack>#include <queue>#include <ctype.h>#include <vector>#include <algorithm>#include <time.h>// cout << "  ===  " << endl;using namespace std;typedef long long ll;const int maxn = 200000 + 7, INF = 0x3f3f3f3f, mod = 1e9+7;int n;int main() {    scanf("%d", &n);    if(n % 2 == 0) {        puts("No");    }    else {        puts("Yes");        for(int i = n-1; i > 0; --i) {            for(int j = 0; j < i; ++j) {                printf("%d%s", (j+1)%2, (j != (i-1) ? " " : "\n") );            }        }    }    return 0;}