#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;


int main()
{
  int n;
  cin >> n;
  vector<vector<int>> a(n, vector<int> (n));
  for (int i = 0; i < n; ++i)
  {
    for (int j = i + 1; j < n; ++j)
    {
      a[j - i - 1][j] = (i % 2 ? i + 1 : -i - 1);
      a[j][j - i - 1] = (i % 2 ? -i - 1 : i + 1);
    }
  }
  vector<vector<int>> b(n, vector<int> (n)), c(n, vector<int> (n));
  for (int i = 0; i < n; ++i)
  {
    for (int j = i + 1; j < n; ++j)
    {
      if (a[j - i - 1][j] >= 0)
      {
        c[j - i - 1][j] = j - i;
        b[j - i - 1][j] = j - i + a[j - i - 1][j];
      }
      else
      {
        b[j - i - 1][j] = j - i;
        c[j - i - 1][j] = j - i - a[j - i - 1][j];
      }
      if (a[j][j - i - 1] >= 0)
      {
        c[j][j - i - 1] = j - i;
        b[j][j - i - 1] = j - i + a[j][j - i - 1];
      }
      else
      {
        b[j][j - i - 1] = j - i;
        c[j][j - i - 1] = j - i - a[j][j - i - 1];
      }
    }
  }
  for (int i = 0; i < n; ++i) b[i][i] = c[i][i] = i + 1;
  for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) cout << b[i][j] << " \n"[j == n - 1];
  for (int i = 0; i < n; ++i) for (int j = 0; j < n; ++j) cout << c[i][j] << " \n"[j == n - 1];
}