#include <bits/stdc++.h>
using namespace std;
long long getAns(vector<long long> a) {
  int n = (int)(a).size();
  vector<long long> sum(n + 1);
  sum[0] = 0;
  for (int i = (0); i < int(n); ++i) {
    sum[i + 1] = sum[i] + a[i];
  }
  long long ans = 0;
  for (int l = (0); l < int(n); ++l)
    for (int r = (1); r < int(n + 1); ++r) {
      ans = max(ans, (r - l) * (sum[r] - sum[l]));
    }
  return ans;
}
long long findAnswer(vector<long long> a) {
  int n = (int)(a).size();
  int k = -1;
  long long res = 0;
  long long cur = 0;
  for (int i = (0); i < int(n); ++i) {
    cur += a[i];
    if (cur < 0) {
      cur = 0;
      k = i;
    }
    res = max(res, (i - k) * cur);
  }
  return res;
}
int main() {
  ios::sync_with_stdio(0);
  long long k;
  cin >> k;
  long long l1 = 1000;
  long long l2 = 999;
  long long s2 = 2 * k;
  long long s1 = -k;
  while (s1 + l1 < 0) {
    s1 += l1;
    s2 -= l1 + l2;
  }
  cout << l1 + l2 << endl;
  vector<long long> ans(l1 + l2);
  for (int i = (l1)-1; i >= int(0); --i) {
    long long sub = max(-1000000LL, s1);
    ans[i] = sub;
    s1 -= sub;
  }
  for (int i = (l1); i < int(l1 + l2); ++i) {
    ans[i] = s2 / l2;
  }
  s2 -= ans[l1] * l2;
  for (int i = (l1); i < int(l1 + l2); ++i) {
    if (s2) {
      ++ans[i];
      --s2;
    }
  }
  for (auto x : ans) {
    assert(abs(x) <= 1000000);
    cout << x << " ";
  }
  cout << endl;
}
