#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

/*
  2
  1 3
  1 1 4
  1 1 1 5
  1 1 1 1 6
*/

constexpr Int M = 100'000;
constexpr Int N = 500'000;
constexpr Int L = 1'000'000'000'000LL;

int main() {
  vector<Int> A(N);
  for (Int i = 0; i <= N - 1 - M*2; ++i) {
    A[i] = L - i;
  }
  for (Int i = N - 1 - M*2; i < N - 1; i += 2) {
    // (i+1) A[i] = A[i+1] + (i+4) A[i+2]
    const Int tar = (i+1) * A[i];
    A[i+2] = (tar - 1) / (i+4 + 1);
    A[i+1] = tar - (i+4) * A[i+2];
// cerr<<i<<": "<<A[i]<<" "<<A[i+1]<<" "<<A[i+2]<<endl;
    assert(A[i] > A[i+1]);
    assert(A[i+1] > A[i+2]);
  }
cerr<<"A[N-1] = "<<A[N-1]<<endl;
  
  printf("%lld\n", N);
  for (Int i = 0; i < N; ++i) {
    if (i) printf(" ");
    printf("%lld", A[i]);
  }
  puts("");
  return 0;
}