#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
const long long longinf = 1LL << 60;
const long long mod = 1e9 + 7;
int main() {
  long long x;
  cin >> x;
  int m = 2000 - x % 500;
  int k = m - 500;
  int sum = (x + m) / 500;
  int a[m];
  for (int i = (int)(0); i < (int)(m - k - 1); ++i) a[i] = 0;
  a[m - k - 1] = -1;
  for (int i = (int)(0); i < (int)(k); ++i) {
    if (sum > 1e6) {
      a[m - k + i] = 1e6;
      sum -= 1e6;
    } else {
      a[m - k + i] = sum;
      sum -= a[m - k + i];
    }
  }
  cout << m << endl;
  for (int i = (int)(0); i < (int)(m); ++i) {
    cout << a[i] << " ";
  }
  return 0;
}
