def search(x):  # a * a <= y を満たす最大のaを求める
    lb = 1
    ub = x + 1
    while ub - lb > 1:
        mid = (ub + lb) // 2
        if mid * mid <= x:
            lb = mid
        else:
            ub = mid
    return lb

def dfs(x,y,n):
    global ans,tmp,ans2
    if n >= ans:
        return
    if x == 0:
        if ans > n:
            ans = n
            ans2 = tmp[:]
        return
    if y == 1:
        if ans > n + x:
            ans = n + x
            ans2 = tmp + [1] * x
        return
    ret = 0
    if x - y * y >= 0:
        tmp.append(y)
        dfs(x - y * y, y, n + 1)
        tmp.pop()
    y -= 1
    if x // (y * y) + n < 16:
        dfs(x, y, n)

tmp = []
ans2 = []
S = int(input())
ans = S + 1
y = search(S)
dfs(S,y,0)
print(ans)
ans2 = [i*i for i in ans2]
print(*ans2)