#include <bits/stdc++.h>
using namespace std;
vector<long long> constructArr(long long s, long long k, long long l) {
  vector<long long> arr(k + l);
  arr[0] = l - 2;
  for (int i = 1; i < l; i++) arr[i] = -1;
  for (int i = arr.size() - 1; i >= l; i--) {
    arr[i] = min(1LL * 1000000, s);
    s -= arr[i];
  }
  return arr;
}
void solve() {
  long long t;
  cin >> t;
  for (long long l = 2; l <= 2000; l++)
    for (long long k = 1; k <= 2000; k++) {
      if ((t + k) % l == 0) {
        long long s = (t + k + l) / l;
        if (s <= k * 1000000) {
          vector<long long> arr = constructArr(s, k, l);
          cout << arr.size() << endl;
          for (int i = 0; i < arr.size(); i++)
            cout << arr[i] << (i == arr.size() - 1 ? "" : " ");
          cout << endl;
          return;
        }
      }
    }
  cout << -1 << endl;
  return;
}
void unitTesting() {}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  solve();
  return 0;
}
