#include <bits/stdc++.h>
using namespace std;
int n, a[2002], s[2002];
int find_answer() {
  int res = 0, cur = 0, k = -1;
  for (int i = 0; i < n; ++i) {
    cur += a[i];
    if (cur < 0) cur = 0, k = i;
    res = max(res, (i - k) * cur);
  }
  return res;
}
int find_my_answer() {
  s[0] = a[0];
  for (int i = 1; i < n; ++i) s[i] = s[i - 1] + a[i];
  int res = s[n - 1] * n;
  for (int i = 1; i < n; ++i) res = max(res, (s[n - 1] - s[i - 1]) * (n - i));
  return res;
}
int main() {
  int k;
  scanf("%d", &k);
  if (k + 2 <= 1000000) {
    printf("2\n-1 %d", k + 2);
    return 0;
  }
  for (n = 3; n <= 2000; ++n) {
    int x = k, y = 0;
    while (x % (n - 1)) x += n, ++y;
    if (x / (n - 1) > 1000000) continue;
    a[n - 1] = x / (n - 1);
    for (int i = n - 2, j = 0; i >= 0; --i, ++j) {
      if (y % (n - 1) == 0)
        a[i] = -y / (n - 1);
      else if (j < y % (n - 1))
        a[i] = -(y / (n - 1) + 1);
      else
        a[i] = -(y / (n - 1));
    }
    if (find_answer() + k == find_my_answer()) {
      printf("%d\n", n);
      for (int i = 0; i < n; ++i) printf("%d%c", a[i], " \n"[i == n - 1]);
      return 0;
    }
  }
}
