n = int(input())
def dfs(i):
    if i==2:
        v = n-lst[0]-lst[1]
        if v >= lst[1]:
            lst[2] = v
            print(*lst)
            lst[2] = 1
        return
    for j in range(lst[i-1],n-lst[i-1]):
        lst[i] = j
        dfs(i+1)
    lst[i] = 1
lst = [1,1,1]
dfs(0)