from itertools import count, permutations


def distinct_permutations(a: list):  # -> Generator[list, None, None]:
    n = len(a)
    xs = a.copy()
    while 1:
        yield xs
        p = -1
        for i in range(n-1):
            if xs[i] < xs[i+1]:
                p = i
        if p == -1: return
        q = -1
        for i in range(p+1, n):
            if xs[p] < xs[i]:
                q = i

        xs[p], xs[q] = xs[q], xs[p]
        xs[p+1:] = reversed(xs[p+1:])


N = int(input())

s = set()
for x in range(N+1):
    if 3*x*x > N: break
    for y in range(x, N+1):
        if x == y == 0: continue
        if x*x + y*y + y*x > N: break
        if (N - x*y) % (x + y) != 0: continue
        z = (N - x*y) // (x + y)
        if y <= z:
            s.add((x, y, z))

ans = []
for e in s:
    for xs in distinct_permutations(list(e)):
        ans.append(xs[:])

print(len(ans))
for a in ans:
    print(*a)