#include<cstdio>

#include<cctype>

#include<cmath>

#include<cstring>

#include<algorithm>

#define lc ch[x][0]

#define rc ch[x][1]

#define rep(s,t) for(int i=s;i<=t;i++)

#define ren for(int i=first[x];i!=-1;i=next[i])

using namespace std;

inline int read() {

    int x=,f=;char c=getchar();

    for(;!isdigit(c);c=getchar()) if(c=='-') f=-;

    for(;isdigit(c);c=getchar()) x=x*+c-'';

    return x*f;

}

const int maxn=;

struct bign {

    int len,s[maxn];

    bign() {len=;fill(s,s+maxn,);}

    bign operator = (int a) {

         len=;while(a) s[len++]=a%,a/=;

    }

    void clean() {while(len>&&!s[len-]) len--;}

    void print() {

         int cnt=;

         rep(len,) s[i]=;

         for(int i=;i>=;i--) {

             putchar(s[i]+'');

             if(++cnt==) cnt=,putchar('\n');

         }

    }

    bign operator * (bign &b) {

         bign ans;

         rep(,len-)

           for(int j=;j<b.len;j++)

             if(i+j<) ans.s[i+j]+=s[i]*b.s[j];

         ans.len=min(len+b.len+,);

         rep(,ans.len-) ans.s[i+]+=ans.s[i]/,ans.s[i]%=;

         ans.clean();

         return ans;

    }

};

void pow(bign& ans,int n) {

     bign tmp;tmp=ans;n--;

     while(n) {

          if(n&) ans=ans*tmp;

          tmp=tmp*tmp;n>>=;

     }

}

int main() {

    int n=read();

    bign ans;ans=;pow(ans,n);

    ans.s[]--;printf("%d\n",int(log10()*n)+);

    ans.print();

    return ;

}