#############################################################

import sys
sys.setrecursionlimit(10**7)

from heapq import heappop,heappush
from collections import deque,defaultdict,Counter
from bisect import bisect_left, bisect_right
from itertools import product,combinations,permutations

ipt = sys.stdin.readline

def iin():
    return int(ipt())
def lmin():
    return list(map(int,ipt().split()))

MOD = 998244353
#############################################################

S = iin()
ans = []
while S:
    t = int(S**0.5)
    for i in range(t+2,t-3,-1):
        if i**2 <= S:
            ans.append(i**2)
            S -= i**2
            break

print(len(ans))
print(*ans)