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()
if N == 1:
    s.add((0, 1, 1))

for x in count():
    if 3*x*x > N: break
    for y in count(x):
        if x*x + y*y + y*x > N: break
        for z in count(y):
            if x == 0 and y == 0: break
            t = x*y + y*z + z*x
            if t > N: break
            if t == N:
                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)