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

using namespace std;


int main()
{
  int n;
  cin >> n;
  int d[3] = {0, 2, 1}, cnt[3] = {0, 0, 0};
  int mid = 0;
  for (int i = 0; i < 3; ++i)
  {
    for (int j = 0; j < n; ++j) for (int k = 0; k <= j; ++k) cnt[i] += (k % 3 == d[(i + j) % 3]);
    if (cnt[mid] > cnt[i]) mid = i;
  }
  for (int i = 0; i < n; ++i) for (int j = 0; j <= i; ++j) cout << (j % 3 == d[(mid + i) % 3] ? 2 : 1) << " \n"[j == i];
}