#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,m,n) for(int i=m; i<n; ++i)
#define repl(i,m,n) for(ll i=m; i<n; ++i)

int main(){
    ll S;
    cin >> S;

    vector<ll> ans;
    while(S > 0LL){
        ll ok = 0LL, ng = 1000000001LL;
        while(abs(ok - ng) > 1LL){
            ll ce = (ok + ng)/2LL;
            if(ce * ce > S) ng = ce;
            else ok = ce;
        }
        ans.push_back(ok * ok);
        S -= ok * ok;
    }

    int sz = ans.size();
    sort(ans.begin(), ans.end());

    cout << sz << endl;
    rep(i, 0, sz){
        cout << ans[i];
        cout << (i == sz-1 ? '\n' : ' ');
    }

    return 0;
}