#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int INF = (int)1e9 + 1001010;
constexpr ll llINF = (ll)4e18 + 22000020;
const string endn = "\n";
template <class T> inline auto vector2(size_t i, size_t j, const T &init = T()) {return vector(i, vector<T>(j, init));}
const string ELEM_SEPARATION = " ", VEC_SEPARATION = endn;
template<class T> istream& operator >>(istream &i, vector<T> &A) {for(auto &I : A) {i >> I;} return i;}
template<class T> ostream& operator <<(ostream &o, const vector<T> &A) {int i=A.size(); for(auto &I : A){o << I << (--i ? ELEM_SEPARATION : "");} return o;}
template<class T> ostream& operator <<(ostream &o, const vector<vector<T>> &A) {int i=A.size(); for(auto &I : A){o << I << (--i ? VEC_SEPARATION : "");} return o;}
template<class T> vector<T>& operator ++(vector<T> &A, int n) {for(auto &I : A) {I++;} return A;}
template<class T> vector<T>& operator --(vector<T> &A, int n) {for(auto &I : A) {I--;} return A;}
template<class T, class U> bool chmax(T &a, const U &b) {return ((a < b) ? (a = b, true) : false);}
template<class T, class U> bool chmin(T &a, const U &b) {return ((a > b) ? (a = b, true) : false);}
ll floor(ll a, ll b){if(b < 0) a = -a, b = -b; return a >= 0 ? a/b : (a+1)/b - 1;}
ll ceil (ll a, ll b){if(b < 0) a = -a, b = -b; return a > 0 ? (a-1)/b + 1 : a/b;}
ll bit(unsigned long long val, unsigned long long digit){return (val >> digit) & 1;}
// ================================== ここまでテンプレ ==================================

template<class Judgement>
ll binary_search_ll(ll ok, ll ng, Judgement judge){
    auto need_continue = [&]() -> bool {
        if(ok > ng) return((__int128_t)ok - (__int128_t)ng > 1);
        else return ((__int128_t)ng - (__int128_t)ok > 1);
    };
    while(need_continue()){
        ll mid = ((__int128_t)ok + (__int128_t)ng) / 2;
        if(judge(mid)) ok = mid;
        else ng = mid;
    }
    return ok;
};

bool is_add_overflow(ll a, ll b){ return __builtin_add_overflow_p(a, b, 0LL); }
bool is_sub_overflow(ll a, ll b){ return __builtin_sub_overflow_p(a, b, 0LL); }
bool is_mul_overflow(ll a, ll b){ return __builtin_mul_overflow_p(a, b, 0LL); }

int main(int argc, char *argv[]){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll s; cin >> s;
    vector<ll> ans;
    {
        ll r = s;
        while(r > 0){
            auto judge = [&](ll m) -> bool {
                if(is_mul_overflow(m, m)) return false;
                else return (m*m <= r);
            };
            ll sq = binary_search_ll(0, 2e9, judge);
            r -= sq*sq;
            ans.emplace_back(sq*sq);
        }
    }

    assert(ans.size() <= 15);
    assert(accumulate(ans.begin(), ans.end(), 0LL) == s);

    cout << ans.size() << endl;
    cout << ans << endl;
    return 0;
}