#include <iostream>
#include <vector>

using namespace std;

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int64_t l = 1e11, c = 446000, k = 0;
  vector<int64_t> a;
  while (1) {
    bool ok = 0;
    for (int b = 1; b < 5; ++b) {
      int64_t d = (2 * l * b + c - b - 1) / (c - b), req = d * (c - b) - 2 * l * b, s = 0, mx = d;
      if (l + d >= 1e12) break;
      a.resize(a.size() + b);
      for (int k = b; k--; ) {
        int64_t m = min(min(req, mx - 1), (d * (c - b) - l * (b - k + 1) - s) / (c - k + 1));
        mx = m;
        if (req && !(k && m) || m < 0) break;
        a.end()[k - b] = l + m;
        s += l + m;
        req -= m;
        if (!k) ok = 1;
      }
      if (ok) { l += d, c -= b, ++k; break; }
      else a.resize(a.size() - b);
    }
    if (!ok) break;
  }
  for (int i = 0; i < c; ++i) a.push_back(a.back() + 1);
  cout << a.size() << '\n';
  for (auto& a: a) cout << a << ' ';
}