#include <bits/stdc++.h>
using namespace std;
const int nine = 1000000000;
const int six = 1000000;
const int ddiv = 1501;
const int MaxN = 2000;
int a[2001];
int main() {
  int k;
  cin >> k;
  for (int i = 1; i <= ddiv; i++) {
    a[i] = ((i <= (ddiv / 2)) ? 1 : -1);
  }
  a[ddiv - 1]--;
  for (int i = ddiv + 1; i <= MaxN; i++) a[i] = -six;
  int mod = k % ddiv;
  int x = (ddiv - mod) % ddiv;
  for (int i = six; i >= 1; i--) {
    if (i % ddiv == x) {
      a[MaxN] = i;
      break;
    }
  }
  int p = a[MaxN] / ddiv;
  int realDiv = k / ddiv;
  int t = realDiv + p + 1;
  a[ddiv] = t + 1;
  puts("2000");
  for (int i = 1; i <= MaxN; i++) {
    cout << a[i] << " ";
  }
  puts("");
}
