def bsearch(n,l,r,res)
	if r<l then
		return res
	end
	m=(l+r)/2
	m2=m*m
	if m2==n then
		return m2
	else
		if m2<n && res<m2 then
			res=m2
		end
		if m2<n then
			return bsearch(n,m+1,r,res)
		else
			return bsearch(n,l,m-1,res)
		end
	end
end
n=gets.to_i
ans=[]
while n>0 do
	t=bsearch(n,1,10**10,1)
	n-=t
	ans<<t
end
puts ans.size
puts ans.join(" ")