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 

// Problem: A. Fancy Fence
// Contest: Codeforces - Codeforces Round #165 (Div. 2)
// URL: https://codeforces.com/problemset/problem/270/A
// Memory Limit: 256 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)
import java.util.*;
import java.io.*;
import java.lang.*;
public class Main
{
	public static Scanner scan = new Scanner(System.in);
	static long gcd(long A,long B)
	{
		if(A==0)
			return B;
		if(B==0)
			return A;
		return gcd(B,A%B);
	}
	static int lower_bound(long[] a,int N,long value)
    {
    	int low = 0,high = N;
    	while(low<high)
    	{
    		int mid = low + (high-low)/2;
    		if(a[mid]==value)
    			high=mid;
    		else if(a[mid]<value)
    			low=mid+1;
    		else
    			high=mid;
    	}
    	if(a[low]!=value)
    		return low+1;
    	return low;
    }
    static int upper_bound(long[] a,int N,long value)
    {
    	int low = 0,high = N;
    	while(low<high)
    	{
    		int mid = low + (high-low)/2;
    		if(a[mid]==value)
    			low=mid+1;
    		else if(a[mid]<value)
    			low=mid+1;
    		else
    			high=mid;
    	}
    	if(a[high]!=value)
    		return high+1;
    	return high;
    }
  	public static void main(String args[])
    {
        int testcases=1;
        //testcases = scan.nextInt();
        //scan.nextLine();
        while(testcases-->0)
        {
            solve();
        }
    }
    static void solve()
    {
       int N = scan.nextInt();
       for(int i=1;i<N;i++)
       {
       		for(int j=1;j<N;j++)
       		{
       			System.out.print(i*j+" ");
       		}
       		System.out.println();
       }
    }
}
