#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define pdi pair<db,int>
#define mp make_pair
#define pb push_back
#define enter putchar('\n')
#define space putchar(' ')
#define eps 1e-8
#define mo 974711
#define MAXN 200005
//#define ivorysi
using namespace std;
typedef long long int64;
typedef double db;
template<class T>
void read(T &res) {
    res = 0;char c = getchar();T f = 1;
    while(c < '0' || c > '9') {
	if(c == '-') f = -1;
	c = getchar();
    }
    while(c >= '0' && c <= '9') {
	res = res * 10 + c - '0';
 	c = getchar();
    }
    res *= f;
}
template<class T>
void out(T x) {
    if(x < 0) {x = -x;putchar('-');}
    if(x >= 10) {
	out(x / 10);
    }
    putchar('0' + x % 10);
}
int N;
int64 a[55],K;
void Solve() {
    read(K);
    N = 50;
    a[1] = K / N;
    for(int i = 2 ; i <= N ; ++i) {
	a[i] = a[i - 1] + 1;
    }
    int t = K % N;
    for(int i = 1 ; i <= t ; ++i) {
	a[i] += N;
	for(int j = 1 ; j <= N ; ++j) {
	    if(i != j) a[j]--;
	}
    }
    out(N);enter;
    for(int i = 1 ; i <= N ; ++i) {
	out(a[i]);space;
    }
    enter;
}
int main() {
#ifdef ivorysi
    freopen("f1.in","r",stdin);
#endif
    Solve();
    return 0;
}

#include <bits/stdc++.h>
using namespace std;

int main() {
  int A,B,ans=1; cin >> A >> B;
  if(B==1) cout << 0 << endl;
  else if(A>=B) cout << 1 << endl;
  else{
    int sum = A*ans;
    while(sum < B) {
      ans++;
      sum += (A-1);
    }
    cout << ans << endl;
  }
}