#include <bits/stdc++.h>
using namespace std;
const long long int N = 1e5 + 7;
const long long int mod = 1e9 + 7;
void solve1() {
  long long int n;
  cin >> n;
  vector<long long int> v;
  v.push_back(-1);
  v.push_back(1);
  if (n - 1e6 + 2 >= 0)
    v.push_back(1e6), n -= 1e6 - 2;
  else {
    v.push_back(n + 2), n = 0;
  }
  while (n - 1e6 + 1 >= 0) v.push_back(1e6), n -= 1e6 - 1;
  v.push_back(n + 1);
  cout << v.size() << endl;
  ;
  for (auto i : v) cout << i << " ";
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  srand(time(0));
  long long int cghf = 1;
  while (cghf--) {
    solve1();
  }
}
