from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right, insort
from itertools import permutations, combinations, groupby
from heapq import heappop, heappush
import math, sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
def printl(li, sep=" "): print(sep.join(map(str, li)))
def yn(flag): print(Yes if flag else No)
_int = lambda x: int(x)-1
MOD = 998244353 #10**9+7
INF = 1<<60
Yes, No = "Yes", "No"

N = int(input())
d, r = N//3, N%3
ans = [[d]*3 for _ in range(3)]
if d&1:
    for i in range(r):
        for j in range(3):
            ans[i][j] += 1
else:
    for i in range(r):
        for j in range(3):
            ans[j][i] += 1
for i in range(3):
    printl(ans[i])