#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <deque>
#include <queue>
#include <iomanip>
#include <cassert>
#include <cmath>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i=0;i < (int)(n);i++)

void solve(){
   ll s;
   cin >> s;
   vector<ll> ans;
   for (int i = 0; i < 15;i++){
      if (s == 0) break;
      ll ss = round(sqrtl(s));
      if (ss*ss > s) ss--;
      ans.push_back(ss*ss);
      s -= ss*ss;
   }
   cout << ans.size() << endl;
   for (auto e:ans){
      cout << e << " ";
   }
   cout << endl;
   
   return;
}
  

int main(){
  int tt = 1;
  //cin >> tt;
  while(tt--){
	  solve();
  }
  return 0;
}