import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write

N=int(readline())
ans_lst=[]
for x in range(N+1):
    if 3*x*x>N:
        break
    for y in range(max(1,x),N+1):
        if 2*x*y+x*x>N:
            break
        if (N-x*y)%(x+y)==0:
            z=(N-x*y)//(x+y)
            if y<=z:
                ans_lst+=list({(x,y,z),(x,z,y),(y,x,z),(y,z,x),(z,x,y),(z,y,x)})
print(len(ans_lst))
for x,y,z in ans_lst:
    print(x,y,z)