def devisors(n):
    d = []
    a = 1
    while a * a < n:
        if n % a == 0:
            d.append(a)
            d.append(n // a)
        a += 1
    if a * a == n:
        d.append(a)
    return d


n = int(input())
x = 0
ans = []
while x * x <= n:
    a = max(1, x * 2)
    nn = n + x * x
    while a * a < nn:
        if nn % a == 0:
            z = nn // a - x
            y = a - x
            if x == y:
                ans.append((x, y, z))
                ans.append((z, x, y))
                ans.append((x, z, y))
            else:
                ans.append((x, y, z))
                ans.append((y, x, z))
                ans.append((z, x, y))
                ans.append((z, y, x))
                ans.append((x, z, y))
                ans.append((y, z, x))
        a += 1
    if a * a == nn:
        z = a - x
        y = a - x
        if x == y:
            ans.append((x, y, z))
        else:
            ans.append((x, y, z))
            ans.append((y, x, z))
            ans.append((y, z, x))
    x += 1
print(len(ans))
for x, y, z in ans:
    print(x, y, z)