#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef long long ll;
typedef vector<ll> VI;
typedef basic_string<int> BI;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

//ll f[1111],ret,g[30][30][1111],tg[30][1111];
map<pair<VI,VI>,map<ll,ll>> hs;
map<ll,ll> count(VI s,VI coef) {
	map<ll,ll> v;
	if (s[0]==0) {
		bool z=1;
		for (auto x:s) z&=(x==0);
		if (z) v[0]=1;
		return v;
	}
	if (hs.count(mp(s,coef))) return hs[mp(s,coef)];
	if (SZ(s)>=2) {
		VI ss=s,cc=coef;
		ss.pop_back(); cc.pop_back();
		if (count(ss,cc).empty()) return v;
	}
	for (int j=1;j<=s[0];j++) for (int k=1;k*j<=s[0];k++) {
		VI ncoef=coef,ns=s; ncoef.insert(ncoef.begin(),k);
		bool val=1;
		rep(l,0,SZ(s)) {
			ns[l]=ns[l]-j*ncoef[l];
			if (ns[l]<0) { val=0; break; }
		}
		ncoef.pop_back();
		if (val) {
			auto d=count(ns,ncoef);
			for (auto [key,val]:d) v[key+j*coef.back()]+=val;
		}
	}
	return hs[mp(s,coef)]=v;
}
vector<array<VI,3>> ret;
void dfs(VI s,VI coef,VI p1,VI p2) {
	//printf("?? %lld %d\n",s[0],SZ(p1));
	if (s[0]==0) {
		bool z=1;
		for (auto x:s) z&=(x==0);
		if (z) {
			reverse(all(p1));
			reverse(all(p2));
			int d=SZ(p2);
			VI p3=p2;
			while (1) {
				__int128_t x=0;
				rep(j,0,d) x+=(__int128_t)p1[j]*p3[SZ(p3)-d+j];
				if (x>=(1ll<<62)||SZ(p3)>=100) break;
				p3.pb(x);
			}
			p3=VI(p3.begin()+d,p3.end());
			ret.pb({p3,p1,p2});
		}
	}
	if (!hs.count(mp(s,coef))) return;
	if (hs[mp(s,coef)].empty()) return;
	//assert(hs.count(mp(s,coef)));
	//if (count(s,coef).empty()) return;
	for (int j=1;j<=s[0];j++) for (int k=1;k*j<=s[0];k++) {
		VI ncoef=coef,ns=s; ncoef.insert(ncoef.begin(),k);
		bool val=1;
		rep(l,0,SZ(s)) {
			ns[l]=ns[l]-j*ncoef[l];
			if (ns[l]<0) { val=0; break; }
		}
		VI q1=p1,q2=p2; q1.pb(j); q2.pb(k);
		ncoef.pop_back();
		if (val) dfs(ns,ncoef,q1,q2);
	}
}
int K;
VI seq;
int main() {
	scanf("%d",&K);
	rep(i,1,25) {
		auto d=count(VI{i},VI{i});
		ll z=0;
		for (auto [key,val]:d) {
			z+=val;
		}
		if (K>z) {
			K-=z;
		} else {
			seq.pb(i);
			break;
		}
	}
	ll v=0;
	rep(rd,1,10) {
		auto d=count(seq,seq);
		for (auto [key,val]:d) {
			if (K>val) {
				K-=val;
			} else {
				seq.pb(key);
				fprintf(stderr,"%lld %lld\n",key,val);
				v=val;
				break;
			}
		}
		if (v<=400000) break;
	}
	//printf("?? %d\n",SZ(seq));
	count(seq,seq);
	dfs(seq,seq,VI{},VI{});
	assert(SZ(ret)==v);
	sort(all(ret));
	fprintf(stderr,"!! %d\n",K);
	auto [p3,p1,p2]=ret[K-1];
	printf("%d\n",SZ(p1));
	p3.resize(10);
	for (auto x:p1) printf("%lld ",x); puts("");
	for (auto x:p2) printf("%lld ",x); puts("");
	for (auto x:p3) printf("%lld ",x); puts("");
}