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

const int N = 1020;

int p,res[N],bas[N],lin[N];

void mul_1(){
	memset(lin,0,sizeof(lin));
	for(int i=1;i<=500;i++){
		for(int j=1;j<=500;j++){
			lin[i+j-1]+=res[i]*bas[j];
		}
	}
	for(int i=1;i<=500;i++){
		lin[i+1]+=lin[i]/10;
		lin[i]%=10;
	}
	memcpy(res,lin,sizeof(res));
}

void mul_2(){
	memset(lin,0,sizeof(lin));
	for(int i=1;i<=500;i++){
		for(int j=1;j<=500;j++){
			lin[i+j-1]+=bas[i]*bas[j];
		}
	}
	for(int i=1;i<=500;i++){
		lin[i+1]+=lin[i]/10;
		lin[i]%=10;
	}
	memcpy(bas,lin,sizeof(bas));
}

int main(){
	freopen("mason.in","r",stdin);
	freopen("mason.out","w",stdout);
	scanf("%d",&p);
	printf("%d\n",(int)(log10(2)*p+1));
	res[1]=1;
	bas[1]=2;
	while(p!=0){
		if(p%2==1){
			mul_1();
		}
		mul_2();
		p/=2;
	}
	res[1]-=1;	
	for(int i=500;i>=1;i--){
		if(i!=500&&i%50==0)printf("\n%d",res[i]);
        else printf("%d",res[i]);
	}
    return 0;
}