#include <bits/stdc++.h>
using namespace std;
int readInt() {
  int x;
  if (scanf(" %d", &x) == EOF) return -1;
  return x;
}
long long int readLint() {
  long long int x;
  if (cin >> x) return x;
  return -1;
}
string readString() {
  string s;
  if (cin >> s) return s;
  return "";
}
struct SingleCase {
  long long int getBad(vector<int>& v) {
    int cur = 0, k = -1, res = 0;
    for (int i = 0; i < v.size(); ++i) {
      cur += v[i];
      if (cur < 0) {
        cur = 0;
        k = i;
      }
      res = max(res, (i - k) * cur);
    }
    return res;
  }
  long long int getGood(vector<int>& v) {
    long long int ret = 0;
    int n = v.size();
    for (int i = 0; i < n; i++) {
      long long int sum = 0;
      for (int j = i; j < n; j++) {
        sum += v[j];
        long long int cand = sum * (j - i + 1);
        ret = max(ret, cand);
      }
    }
    return ret;
  }
  void verify(vector<int>& v, long long int k) {
    long long int a = getBad(v);
    long long int b = getGood(v);
    assert(b - a == k);
    cout << "Verified!!!" << endl;
  }
  bool solveCase() {
    int k = readInt();
    if (k < 0) return false;
    int M = 2000;
    vector<int> out;
    for (int y = 1000000; y >= 0; y--)
      if ((k + y) % M == 0) {
        int z = (k + y) / M;
        int x = y - z;
        assert(y >= x && x > M - 2);
        vector<int> out;
        for (int i = 0; i < M - 2; ++i) out.push_back(0);
        out.push_back(-x);
        out.push_back(y);
        printf("%d\n", (int)out.size());
        for (int i = 0; i < out.size(); ++i) {
          if (i) printf(" ");
          printf("%d", out[i]);
        }
        cout << endl;
        break;
      }
    return true;
  }
};
int main() {
  while (SingleCase().solveCase()) {
  };
}
