def Floor_Root(a,k):
    """floor(a^(1/k)) を求める.

    a:非負整数
    k:正の整数
    """
    assert 0<=a and 0<k
    if a==0: return 0
    if k==1: return a

    #大体の値を求める.
    x=int(pow(a,1/k))

    #増やす
    while pow(x+1,k)<=a:
        x+=1

    #減らす
    while pow(x,k)>a:
        x-=1
    return x

def solve():
    S = int(input())

    A = []
    while S:
        x = Floor_Root(S, 2)
        A.append(x * x)
        S -= x * x

    print(len(A))
    print(*A)

#==================================================
solve()