#include <bits/stdc++.h>
using namespace std;
void solve() {
  int k;
  cin >> k;
  vector<int> aa;
  aa.push_back(-1);
  int x = k + 2, n = 1, r = 0, m = x;
  int mx = 1000000;
  if (x > mx) {
    n = x / mx;
    r = x % mx;
    m = mx;
  };
  for (int i = 0; i < n; ++i) {
    aa.push_back(m);
  }
  if (r) {
    r = r + n;
    ;
    if (r <= mx) {
      aa.push_back(r);
    } else {
      aa.push_back(mx);
      aa.push_back(r % mx + 1);
    }
  }
  if (!r && n > 1) {
    if (n <= mx) {
      aa.push_back(n);
    } else {
      aa.push_back(mx);
      aa.push_back(n % mx);
    }
  }
  if (((int)(aa).size()) > 2000) {
    cout << (-1) << '\n';
  } else {
    long long sum = accumulate((aa).begin(), (aa).end(), 0);
    assert(sum - ((int)(aa).size()) + 1 == k);
    cout << (((int)(aa).size())) << '\n';
    if (0)
      cout << "aa"
           << ": ";
    for (int y = 0; y < ((int)(aa).size()); ++y) {
      cout << aa[y];
      if (y < ((int)(aa).size()) - 1) cout << " ";
    }
    cout << "\n";
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  solve();
  return 0;
}
