#include <bits/stdc++.h>
const long long MAX_N = 1e5 + 100;
const long long MOD = 1e9 + 7;
using namespace std;
int main() {
  int k;
  cin >> k;
  if (k == 1) return cout << "3\n1 -2 2", 0;
  int n = 1999;
  k -= 2;
  k += n;
  if (k % 2) k++, n++;
  k /= 2;
  int now = k + 1;
  if (now > 2e9) return cout << -1, 0;
  cout << n << "\n";
  cout << "1 -2 ";
  for (int i = 3; i <= n; ++i) {
    int t = min((int)1e6, now);
    now -= t;
    cout << t << " ";
  }
  return 0;
}
