RT，谢谢！

#include<bits/stdc++.h>
using namespace std;
#define maxn 100001
int f[maxn],p,res[maxn],sav[maxn];
void mul1(){
	memset(sav,0,sizeof(sav));for(int i=1;i<=500;i++)
	for(int j=1;j<=500;j++) sav[i+j-1]+=res[i]*f[j];
	for(int i=1;i<=500;i++) sav[i+1]+=sav[i]/10,sav[i]%=10;
	memcpy(res,sav,sizeof(res));
}
void mul2(){
	memset(sav,0,sizeof(sav));for(int i=1;i<=500;i++)
	for(int j=1;j<+500;j++) sav[i+j-1]+=f[i]*f[j];
	for(int i=1;i<=500;i++) sav[i+1]+=sav[i]/10,sav[i]%=10;
	memcpy(f,sav,sizeof(f));
}
int main()
{
	scanf("%d",&p);printf("%d\n",(int)(log10(2)*p+1));
	res[1]=1;f[1]=2;while(p!=0){
		if(p%2==1)mul1();
		p/=2;mul2();
	}	
	res[1]-=1;for(register int i=500;i>=1;i--)if(i!=500&&i%50==0)
	printf("\n%d",res[i]);else printf("%d",res[i]);return 0;
}