Distinct sums

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

long long p = 1000000007;

long long power(long long x, long long n) {
  if(n == 0) return (1 % p);
  long long xx = power(x, n/2);
  xx = (xx * xx) % p;
  if(n%2==1) xx = (xx * x) % p;
  return xx;
}

int main() {
  int n;
  cin >> n;
  if (n % 2 == 1) {
    cout << "IMPOSSIBLE" << endl;
    return 0;
  }
  cout << "YES" << endl;
  
  for (int i = 0; i < n - 1; ++i) {
    for (int j = 0; j < i; ++j) {
      cout << 0 << " ";
    }
    cout << (1 - (i % 2)) << " ";
    for (int j = i + 1; j < n - 1; ++j) {
      cout << 2 << " ";
    }
    cout << 2 << endl;
  }
  
  for (int i = 0; i < n - 1; ++i)
    cout << 0 << " ";
  cout << 0 << endl;
  
  return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED