9
 8
 6
 4
 7
 5
 2

1  2  3  4  5  6  7  8 
2  4  6  8 11 13 15 17 
3  6 10 13 16 20 23 26 
4  8 13 17 22 26 31 35 
5 11 16 22 27 33 38 44 
6 13 20 26 33 40 46 53 
7 15 23 31 38 46 54 62 
8 17 26 35 44 53 62 71 
 1  2  3  4  5  6  7 
2  4  6 10 12 14 16 
3  6 11 14 17 22 25 
4 10 14 20 24 30 34 
5 12 17 24 31 36 43 
6 14 22 30 36 44 52 
7 16 25 34 43 52 61 
 1  2  3  4  5 
2  4 10 12 14 
3 10 13 20 23 
4 12 20 24 32 
5 14 23 32 41 
 1  2  3 
2 10 12 
3 12 21 
 1  2  3  4  5  6 
2  4  6 11 13 15 
3  6 12 15 21 24 
4 11 15 22 26 33 
5 13 21 26 34 42 
6 15 24 33 42 51 
 1  2  3  4 
2  4 11 13 
3 11 14 22 
4 13 22 31 
 1 

#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
const long long int iEPS = 1e11;
const double PI = 2 * acos(0.0);
int CASE = 1;
int TEST;
template <typename T>
T ceilling(T a) {
  return ((double)((long long int)a)) == a ? (T)a
                                           : (T)((long long int)(a + 1.0));
}
template <typename T>
T flooring(T a) {
  return (T)((long long int)a);
}
template <typename T>
T pairmin(T a, T b) {
  return (a > b) ? b : a;
}
template <typename T>
T pairmax(T a, T b) {
  return (a > b) ? a : b;
}
template <typename T>
T arrymax(T arr[], int arrsize) {
  T m = arr[0];
  for (int i = 0; i < arrsize; i++) {
    if (arr[i] > m) {
      m = arr[i];
    }
  }
  return m;
}
template <typename T>
T arrymin(T arr[], int arrsize) {
  T m = arr[0];
  for (int i = 0; i < arrsize; i++) {
    if (arr[i] < m) {
      m = arr[i];
    }
  }
  return m;
}
template <typename T>
T GCD(T _a, T _b) {
  T _rem = 0;
  while (_b != 0) {
    _rem = _a % _b;
    _a = _b;
    _b = _rem;
  }
  return _a;
}
template <typename T>
T LCM(T a, T b) {
  return ((a * b) / GCD(a, b));
}
template <typename T>
T ABS(T a) {
  return a < 0 ? (-1 * a) : a;
}
bool IsPrime(long long int a) {
  if (a == 2) return true;
  if (a % 2 == 0) return false;
  long long int sqr = (long long int)(sqrt((double)a));
  long long int i = 0;
  for (i = 3; i <= sqr; i += 2) {
    if (a % i == 0) return false;
  }
  return true;
}
bool Permutation(string &s) {
  int i = 0, j = 0, n = 0;
  n = s.length();
  for (i = 0, j = n - 1; i < n / 2, j >= n / 2; i++, j--) {
    if (s[i] != s[j]) {
      return false;
    }
  }
  return true;
}
int main(void) {
  int a = 0, n = 0;
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    printf("%d ", i);
    for (int j = 1; j < n; j++) {
      printf("%d ", j * i);
    }
    cout << endl;
  }
  return 0;
}
