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 



def convertBase(n,  toBase, prevBase = 10):
	#najdi stevilko potence toBase^n ku je vecja, in zacni od ene manj
	str1 = str(n)
	
	i=1
	st = 0
	while i <= n:
		i *= toBase
		st += 1
	#print "st:%s" %st
	
	res = []
	tmpSt = st
	tmpN = n
	for i in range(0,st):
		if i == st-1:
			res.append(str(tmpN%toBase))
			return "".join(res)
		
		trCifra = 1
		for i in range(0,st-1-i):
			trCifra *= toBase
			
		deljeno = int(tmpN / trCifra)
		if deljeno >= 1:
			tmpN = tmpN - (deljeno*trCifra)
			res.append(str(deljeno))
		else:
			res.append("0")


base = int(raw_input())

for i in range(0,base-1):
	if i != base-2:
		print "%d " % (i+1),
	else:
		print "%d" % (i+1)

for i in range(1, base-1):
	print "%d " % (i+1),
	for j in range(1, base-1):
		rez = (i+1) * (j+1)
		if j != base-2:
			print "%d " % ( int(convertBase(rez,base)) ),
		else:
			print "%d" % ( int(convertBase(rez,base)) )
	
