from collections import defaultdict

# https://qiita.com/Kiri8128/items/eca965fe86ea5f4cbb98
# このコードバグってるのかよ……
def gcd(a, b):
    while b: a, b = b, a % b
    return a
def isPrimeMR(n):
    d = n - 1
    d = d // (d & -d)
    L = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]
    for a in L:
        t = d
        y = pow(a, t, n)
        if y == 1: continue
        while y != n - 1:
            y = (y * y) % n
            if y == 1 or t == n - 1: return 0
            t <<= 1
    return 1
def findFactorRho(n):
    m = 1 << n.bit_length() // 8
    for c in range(1, 99):
        f = lambda x: (x * x + c) % n
        y, r, q, g = 2, 1, 1, 1
        while g == 1:
            x = y
            for i in range(r):
                y = f(y)
            k = 0
            while k < r and g == 1:
                ys = y
                for i in range(min(m, r - k)):
                    y = f(y)
                    q = q * abs(x - y) % n
                g = gcd(q, n)
                k += m
            r <<= 1
        if g == n:
            g = 1
            while g == 1:
                ys = f(ys)
                g = gcd(abs(x - ys), n)
        if g < n:
            if isPrimeMR(g): return g
            elif isPrimeMR(n // g): return n // g
            return findFactorRho(g)
def primeFactor(n):
    i = 2
    ret = {}
    rhoFlg = 0
    while i*i <= n:
        k = 0
        while n % i == 0:
            n //= i
            k += 1
        if k: ret[i] = k
        i += 1 + i % 2
        if i == 101 and n >= 2 ** 20:
            while n > 1:
                if isPrimeMR(n):
                    ret[n], n = 1, 1
                else:
                    rhoFlg = 1
                    j = findFactorRho(n)
                    k = 0
                    while n % j == 0:
                        n //= j
                        k += 1
                    ret[j] = k

    if n > 1: ret[n] = 1
    if rhoFlg: ret = {x: ret[x] for x in sorted(ret)}
    return ret

n=int(input())

# e =1
# (r-l)(r+l+1) = 2n

pf=list(primeFactor(2*n).items())
d=[]
def dfs(i,x):
	if i == len(pf):
		d.append(x)
		return
	for j in range(pf[i][1] + 1):
		dfs(i+1,x)
		if j == pf[i][1]:break
		x *= pf[i][0]


dfs(0,1)

ans=[]
for x in d:
	y = 2*n//x
	x -= 1
	if (x+y)%2 != 0:
		continue
	r = (x+y)//2
	l = (x-y)//2
	if l >= r:
		continue
	if 1 <= l + 1:
		ans.append((1,l+1,r))

for e in range(2,10**9):
	if 2**e > n:
		break 

	r=[0]
	for i in range(10**9):
		if (i+1)**e>n:break
		r.append((i+1)**e)
		r[-1] += r[-2]

	s = defaultdict(int)
	for i in range(len(r)):
		s[r[i]] = i

	for i in range(len(r)):
		if r[i]+n in s:
			ans.append((e,i+1,s[r[i]+n]))

ans.sort()

print(len(ans))
for e,l,r in ans:
	print(e,l,r)