n = int(input())  # 表示总配料之和
result = []  # 存储所有存在的方案


def backtrack(n, path):
    if n == 0:
        result.append(path)
        return

    for i in range(10):
        for j in range(1, 4):
            if j + sum(path) > n:
                break
            backtrack(n - j, path + [j])


backtrack(n, [])
# 此时result为二维列表
print(len(result))
for path in result:
    for i in path:
        print(' '.join(map(str, i)))