//KING NIKAN
#include <bits/stdc++.h>
using namespace std;
typedef long long ll ;
ll ans[60] ;
int main() 
{
	ios::sync_with_stdio(false) ;cin.tie(0) ;cout.tie(0) ;
	ll k ;
	cin >> k ;
	cout << 50 << "\n" ;
	ll x=k/50 ;
	for(int i=0 ;i<50 ;i++)
	{
        ans[i] = x+49;
    }
    ll y = k%50;
    for(int k=0 ;k<y ;k++)
	{
        for(int i=0 ;i<50 ;i++)
		{
            if(k==i) 
			{
				ans[i]+=50 ;	
			}
            else 
			{
				ans[i]-=1 ;	
			}
        }
    }
    for(int i=0 ;i<50 ;i++)
    {
    	cout << ans[i] << " " ;
	}
	return 0 ;
}
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF=1e9,MOD=1e9+7,ohara=1e6+10;
const ll LINF=1e18;
using namespace std;

#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(int i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout<<(x)<<endl
#define doublecout(a) cout<<fixed<<setprecision(15)<<a<<endl;
#define Cerr(x) cerr<<(x)<<endl
#define fi first
#define se second
#define P pair<ll,ll> 
#define m_p make_pair
#define V vector<ll> 
#define U_MAP unordered_map<ll,ll>

ll n,cnt,ans[ohara],a,b,c,d,tmp,tmpp,m,h,w,x,y,sum,pos,k;
ld doua;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
//int dy[]={-1,0,1,-1,1,-1,0,1};
//int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"),s;
bool fl;
struct edge{int to,cost;};
ll cou[ohara];

//-------------------------↓↓↓↓↓↓------------------------

//------ 自分を天才だと信じる ------

int main(void){
        cin.tie(0);
        cout.tie(0);
    ios::sync_with_stdio(false);

    cin>>k;
    rep(i,50)ans[i]=i;
    rep(i,50){
        ans[i]+=(k/50)*50;
        cou[i]=k/50;
    }
    rep(i,k%50){
        ans[i]+=50;
        cou[i]++;
    }
    rep(i,50){
        ans[i]-=(k-cou[i]);
    }

    Cout(50);
    rep(i,50){
        if(i==49)Cout(ans[i]);
        else cout<<ans[i]<<" ";
    }
    return 0;
}
