#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e17 + 10;
const int N = 1e6 + 10;
const long long mod = 998244353;
const int base = 131;
const double pi = acos(-1);
map<string, int> ml;
map<int, int> mp;
map<int, int> vi;
priority_queue<pair<int, int> > q;
priority_queue<pair<int, int> > tq;
long long b[N], vis[N], dep[N], num[N], t, n, m, k, x, y;
long long ex, ey, cnt, ans, sum, flag;
int l[N], r[N];
vector<int> v;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> k;
  int sum;
  v.push_back(-1);
  n = 2000;
  int s = k + 2000;
  while (s >= 1e6) {
    s -= 1e6;
    v.push_back(1e6);
  }
  v.push_back(s);
  cout << 2000 << endl;
  for (auto x : v) cout << x << " ";
  for (int i = v.size() + 1; i <= 2000; i++) cout << 0 << " ";
}
