#include <bits/stdc++.h>
#include <cmath>
using namespace std;
int ans[1010] = {0},b[3] = {1,2};
int p;
void cheng(int a[],int b[]){
    int c[1010] = {0};
    memset(c,0,sizeof(c));
    for(int i = 1;i <= a[0];i++){
        for(int j = 1;j <= b[0];j++){
            if(i+j-1 >= 501)continue;
            c[i+j-1] += a[i] * b[j];
            c[0] = i+j-1;
        }
    }
    for(int i = 1;i < c[0];i++){
        c[i+1] += c[i] / 10;
        c[i] %= 10;
    }
    if(c[c[0]] >= 10){
        c[0]++;
        c[c[0]] += c[c[0]-1] / 10;
        c[c[0]-1] %= 10;
    }
    for(int i = 0;i <= c[0];i++)ans[i] = c[i];
}
void miyun(int x){
    if(x == 0){
      ans[1] = 1,ans[0] = 1;
      return;  
    }
    if(x == 1){
       ans[1] = 2,ans[0] = 1;
       return; 
    }
    miyun(x/2);
    cheng(ans,ans);
    if(x % 2)cheng(ans,b);
    return;
} 
int main(){
    freopen("mason.in","r",stdin);
    freopen("mason.out","w",stdout);
    scanf("%d",&p);
    printf("%d\n",long(p*log10(2))+1);
    miyun(p);
    ans[1] -= 1;
    for(int i = 500;i >= 1;i--){
        cout<<ans[i];
        if((i-1) % 50 == 0)cout<<endl;
    }
    
    return 0;
}