#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> sq;
    for(ll i = 1; i*i <= S; i++){
        sq.push_back(i*i);
    }

    vector<ll> ans;
    while(S > 0LL){
        auto itr = upper_bound(sq.begin(), sq.end(), S);
        itr--;
        ll A = *itr;
        ans.push_back(A);
        S -= A;
    }

    sort(ans.begin(), ans.end());

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

    return 0;
}