#include <bits/stdc++.h>
using namespace std;
long long gcdExtended(long long a, long long b, long long *x, long long *y) {
  if (a == 0) {
    *x = 0;
    *y = 1;
    return b;
  }
  long long x1, y1;
  long long gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
int main() {
  long long k;
  cin >> k;
  long long aa = 0, bb = 0;
  for (int l1 = 1; l1 < 2000; l1++) {
    for (int l2 = 1; l2 < 2000; l2++) {
      if (l1 + l2 > 2000) continue;
      long long x = 0, y = 0;
      long long gcd = gcdExtended(l1 + l2, l1, &x, &y);
      if (l1 == 1 && l2 == 1002) {
        cout << "HIII";
      }
      if (k % gcd == 0) {
        long long xx, yy;
        xx = x;
        yy = y;
        x *= k / gcd;
        y *= k / gcd;
        while (x <= 0) {
          x += l1;
          y -= l1 + l2;
        }
        while (x >= 0) {
          x -= l1;
          y += l1 + l2;
        }
        if (y > l2 * 1000000 || x < l1 * (-1000000)) {
          continue;
        }
        cout << l1 + l2 << "\n";
        deque<long long> o1, o2;
        while (x < 0) {
          long long ii = max(x, -1000000LL);
          o1.push_back(ii);
          x -= ii;
          l1--;
        }
        if (l1 < 0) continue;
        while (l1 > 0) {
          l1--;
          o1.push_back(0);
        }
        while (y > 0) {
          long long ii = min(y, 1000000LL);
          o2.push_back(ii);
          y -= ii;
          l2--;
        }
        if (l2 < 0) continue;
        while (l2 > 0) {
          l2--;
          o2.push_back(0);
        }
        for (int i = o1.size() - 1; i >= 0; i--) cout << o1[i] << " ";
        for (int j = 0; j < o2.size(); j++) cout << o2[j] << " ";
        return 0;
      }
    }
  }
  cout << "-1" << endl;
}
