import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

def factors(a):
    if a<=0:return [0]
    dd0,dd1=[],[]
    for d in range(1,round(a**0.5)+1):
        if a%d:continue
        dd0.append(d)
        dd1.append(a//d)
    if dd0[-1]==dd1[-1]:dd1.pop()
    return dd0


# (l+r)(r-l+1)/2=n
# (l+r)(r-l+1)=2n
# r+l=f
# r-l=g-1
# l=(f-g+1)/2
# r=(f+g-1)/2
n=II()
ans=[]

for g in factors(2*n):
    f=2*n//g
    if f&1==g&1:continue
    l=(f-g+1)//2
    r=(f+g-1)//2
    ans.append((1,l,r))
for e in range(2,41):
    cs=[0]
    for i in range(1,10**6+2):
        cs.append(cs[-1]+i**e)
        if i**e>n:break
    s2i={}
    for i,s in enumerate(cs):
        if s-n in s2i:
            ans.append((e,s2i[s-n]+1,i))
        s2i[s]=i
ans.sort()
print(len(ans))
for e,l,r in ans:print(e,l,r)