import sys
sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
from collections import defaultdict, deque, Counter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
from math import gcd

n = int(input())
sq = int(n**0.5)+5
ans = set()
for x in range(sq):
    for y in range(x, sq):
        if x + y == 0: continue
        left = n-x*y
        if left < 0:break
        if left % (x+y) == 0:
            z = left//(x+y)
            if z <y :break
            ans.add((x,y,z))
            ans.add((x,z,y))
            ans.add((y,x,z))
            ans.add((y,z,x))
            ans.add((z,x,y))
            ans.add((z,y,x))

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