#include <bits/stdc++.h>
#include <chrono> 
 
using namespace std;
using namespace std::chrono; 
 
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma optimization_level 3
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define f0r(a, b) for (long long a = 0; a < (b); ++a)
#define f1r(a, b, c) for (long long a = (b); a < (c); ++a)
#define f0rd(a, b) for (long long a = (b); a >= 0; --a)
#define f1rd(a, b, c) for (long long a = (b); a >= (c); --a)
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define pb push_back
#define send {ios_base::sync_with_stdio(false);}
#define help {cin.tie(NULL); cout.tie(NULL);}
#define fix(prec) {cout << setprecision(prec) << fixed;}
#define mp make_pair
#define f first
#define s second
#define all(v) v.begin(), v.end()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define readgraph(list, edges) for (int i = 0; i < edges; i++) {int a, b; cin >> a >> b; a--; b--; list[a].pb(b); list[b].pb(a);}
#define ai(a, n) for (int ele = 0; ele < n; ele++) cin >> a[ele];
#define ain(a, lb, rb) for (int ele = lb; ele <= rb; ele++) cin >> a[ele];
#define ao(a, n) {for (int ele = 0; ele < (n); ele++) { if (ele) cout << " "; cout << a[ele]; } cout << '\n';}
#define aout(a, lb, rb) {for (int ele = (lb); ele <= (rb); ele++) { if (ele > (lb)) cout << " "; cout << a[ele]; } cout << '\n';}
#define vsz(x) ((long long) x.size())
typedef long long ll;
typedef double ld;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
 
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v);
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
  cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}
template<typename A, typename B> istream& operator>>(istream& cin, pair<A, B> &p) {
  cin >> p.first;
  return cin >> p.second;
}
 
// mt19937 rng(steady_clock::now().time_since_epoch().count());
mt19937 rng(61378913);
/* usage - just do rng() */
 
void usaco(string filename) {
  // #pragma message("be careful, freopen may be wrong")
	freopen((filename + ".in").c_str(), "r", stdin);
	freopen((filename + ".out").c_str(), "w", stdout);
}
 
const lld pi = 3.14159265358979323846;
const ll mod = 1000000007;
// const ll mod = 998244353;
// ll mod;
 
 
 
ll n, m, k, q, l, r, x, y, z;
ll a[1000005];
ll b[1000005];
ll c[1000005];
string s, t;
ll ans = 0;
 
ll scan1() {
  ll mn = mod * mod;
  f0r(i, n) {
    mn = min(mn, a[i] - n + 1);
  }
  if (mn <= 0) return 0;
  f0r(i, n) a[i] -= mn;
  return mn * n;
}
 
ll scan2() {
  ll tops = 0;
  f0r(i, n) {
    tops += a[i] / n;
    b[i] = a[i] / n;
    a[i] -= n * (a[i] / n);
  }
  f0r(i, n) {
    a[i] += tops - b[i];
  }
  return tops;
}
 
ll count(ll n) {
  f0r(i, n) a[i] = c[i];
 
  ll ans = 0;
  ll v;
  do {
    v = 0;
    v += scan1();
    v += scan2();
    ans += v;
  } while (v > 0);
  return ans;
}

void solvesmall(ll k) {
  n = 50;
  pll v[50];
  f0r(i, 50) v[i] = mp(-1, -1);
 
  f1r(i, 50, 5000) {
    f0r(j, 49) c[j] = 49;
    c[49] = i;
    ll val = count(50);
    if (v[val % 50].f == -1) {
      v[val % 50] = mp(i, val);
    }
  }
  
  ll vv = k % 50;
  ll fac = (k - v[vv].s) / 50;
  cout << 50 << '\n';
  f0r(i, 49) c[i] = fac + 49;
  c[49] = fac + v[vv].f;
  ao(c, 50);

  // cout << count(n) << '\n';
}
 
void solve(int tc) {
  cin >> k;
 
  if (k < 1e15) {
    solvesmall(k);
    return;
  }
 
  n = 50;
  ll v[50];
  ll base[50][50];
  f0r(i, 50) v[i] = -1;
 
  ll cnt = 0;
  while (1) {
    c[0] = 49;
    f1r(j, 1, 50) c[j] = 49 + rng() % 750;
    ll val = count(50);
    if (v[val % 50] == -1) {
      v[val % 50] = val;
      f0r(i, 50) base[val % 50][i] = c[i];
      ++cnt;
    }
    if (cnt == 50) break;
  }

  // ao(v, 50);
  // f0r(i, 50) {
  //   cout << "BASE " << i << endl;
  //   ao(base[i], 50);
  // }
  
  ll vv = k % 50;
  ll fac = (k - v[vv]) / 50;
  cout << 50 << '\n';
  f0r(i, 50) c[i] = fac + base[vv][i];
  ao(c, 50);
 
  // cout << count(n) << '\n';
}
 
int main() {
  send help
 
  // usaco("cowland");
 
  int tc = 1;
  // cin >> tc;
  for (int t = 0; t < tc; t++) solve(t);
} 

Measured memory_bytes: 3672