def solve(n):
	lst = []
	for i in range(1, n+1):
		for j in range(i, n+1):
			c = n - i - j
			if c < j:
				break
			else:
				lst.append([i, j, c])
	return lst

anslist = solve(int(raw_input()))
for i in range(0, len(anslist)):
	s = str(anslist[i][0]) + ' ' + str(anslist[i][1]) + ' ' + str(anslist[i][2])
	print s