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

#ifndef __x86_64__
#error Only x86-64 targets are supported
#endif
#define __builtin_ia32_adc(x,y,flag) __asm__("addb   %3, %0\n\t" "adcq   %2, %1\n\t" "setc   %0":"+r"(flag),"+r"(x):"r"(y),"i"(-1):"cc")

struct bigint{// made by dengyaotriangle!
    typedef unsigned long long u64;
    typedef unsigned __int128 u128;
    typedef std::size_t st;
    std::vector<u64> data;
    bigint(){}
    bigint(u64 x):data(x?std::vector<u64>{x}:std::vector<u64>{}){}
    bigint(const std::string &s){
        st pos=s.length();
        int cnt=0;
        u64 val=0;
        while(pos){
            pos--;
            if(cnt==64){
                data.push_back(val);
                val=0;cnt=0;
            }
            val|=(u64)(s[pos]=='1')<<cnt;
            ++cnt;
        }
        if(cnt&&val)data.push_back(val);
    }
    explicit operator std::string()const{
        if(data.empty())return "0";
        bool t=0;
        std::string ret;
        for(int i=63;i>=0;i--){
            t|=(data.back()>>i)&1;
            if(t)ret+='0'|((data.back()>>i)&1);
        }
        st i=data.size()-1;
        while(i){
            i--;
            for(int j=63;j>=0;j--)ret+='0'|((data[i]>>j)&1);
        }
        return ret;
    }
    explicit operator bool()const{return !data.empty();}
    explicit operator u64()const{return data.empty()?0:data[0];}
    st digit()const{
        if(data.empty())return 0;
        return (data.size()<<6)-__builtin_clzll(data.back());
    }
    bool operator==(const bigint &a)const{return a.data==data;}
    bool operator!=(const bigint &a)const{return a.data!=data;}
    bool operator<(const bigint &a)const{
        if(data.size()!=a.data.size())return data.size()<a.data.size();
        for(st i=data.size();i;){
            i--;
            if(data[i]!=a.data[i])return data[i]<a.data[i];
        }
        return 0;
    }
    bool operator>(const bigint &a)const{return a<(*this);}
    bool operator<=(const bigint &a)const{return !(*this>a);}
    bool operator>=(const bigint &a)const{return !(*this<a);}
    bigint &operator<<=(st n){
        if(data.empty())return *this;
        int w=n&63;st z=n>>6;
        st i=data.size();
        bool flg=0;
        if(w&&(data.back()>>(64-w)))data.push_back(0),flg=1;
        data.resize(data.size()+z);
        while(i){
            i--;
            if(flg)data[i+z+1]|=data[i]>>(64-w);
            data[i+z]=data[i]<<w;
            flg|=bool(w);
        }
        for(st i=0;i<z;i++)data[i]=0;
        return *this;
    }
    bigint &operator>>=(st n){
        int w=n&63;st z=n>>6,i=0;
        for(;i+z<data.size();i++){
            if(w&&i)data[i-1]|=data[i+z]<<(64-w);
            data[i]=data[i+z]>>w;
        }
        while(data.size()>i)data.pop_back();
        while(!data.empty()&&data.back()==0)data.pop_back();
        return *this;
    }
    bigint operator<<(st n)const{return bigint(*this)<<=n;}
    bigint operator>>(st n)const{return bigint(*this)>>=n;}
    bigint &operator+=(const bigint &a){
        data.resize(std::max(data.size(),a.data.size()));
        bool carry=0;
        for(st i=0;i<data.size();i++){
            u64 rg=0;
            if(i<a.data.size())rg=a.data[i];
            __builtin_ia32_adc(data[i],rg,carry);
        }
        if(carry)data.push_back(1);
        return *this;
    }
    bigint &operator-=(const bigint &a){
        bool carry=1;
        for(st i=0;i<data.size();i++){
            u64 rg=-1;
            if(i<a.data.size())rg=~a.data[i];
            __builtin_ia32_adc(data[i],rg,carry);
        }
        while(!data.empty()&&data.back()==0)data.pop_back();
        return *this;
    }
    bigint &operator++(){return *this+=bigint(1);}
    bigint &operator--(){return *this-=bigint(1);}
    bigint operator++(int){bigint tmp=*this;++*this;return tmp;}
    bigint operator--(int){bigint tmp=*this;--*this;return tmp;}
    bigint &operator*=(const bigint &a){
        std::vector<u64> ret(data.size()+a.data.size());
        for(st i=0;i<data.size();i++){
            u64 carry=0;bool wcarry=0;
            st k=i;
            for(st j=0;j<a.data.size();j++,k++){
                u128 r=data[i]*(u128)a.data[j]+carry;
                u64 cur=r;
                carry=r>>64;
                __builtin_ia32_adc(ret[k],cur,wcarry);
            }
            while(carry||wcarry){
                __builtin_ia32_adc(ret[k],carry,wcarry);
                carry=0;k++;
            }
        }
        while(!ret.empty()&&ret.back()==0)ret.pop_back();
        data=ret;
        return *this;
    }
    bigint &operator/=(const bigint &a){
        if(a.digit()>digit()){
            data.clear();
            return *this;
        }
        st z=digit()-a.digit();
        std::vector<u64> ret;
        while(1){
            bigint tmp=a<<z;
            if(tmp<=*this){
                *this-=tmp;
                st v1=z>>6;
                if(ret.size()<=v1)ret.resize(v1+1);
                ret[v1]|=(u64)(1)<<(z&63);
            }
            if(!z)break;
            z--;
        }
        data=ret;
        return *this;
    }
    bigint &operator%=(const bigint &a){
        if(a.digit()>digit())return *this;
        st z=digit()-a.digit();
        while(1){
            bigint tmp=a<<z;
            if(tmp<=*this)*this-=tmp;
            if(!z)break;
            z--;
        }
        return *this;
    }
    bigint operator+(const bigint &a)const{return bigint(*this)+=a;}
    bigint operator-(const bigint &a)const{return bigint(*this)-=a;}
    bigint operator*(const bigint &a)const{return bigint(*this)*=a;}
    bigint operator/(const bigint &a)const{return bigint(*this)/=a;}
    bigint operator%(const bigint &a)const{return bigint(*this)%=a;}
};
std::istream &operator>>(std::istream &st,bigint &a){
    std::string s;st>>s;a=bigint(s);return st;
}
std::ostream &operator<<(std::ostream &st,const bigint &a){
    return st<<(std::string)(a);
}

typedef long long ll;
typedef __int128 lll;
const ll prime[7] = {2,325,9375,28178,450775,9780504,1795265022};

bigint n,phi;

namespace Sub1 {
    vector<long long> v;
    void print(ll x) { if(!x) return; print(x>>1); putchar('0'+(x&1)); }
    void work()
    {
        ll n=(unsigned long long)(::n);
        
        for(lll i=2; i*i<=n; i++)
        if(n%i==0)
        {
            while(n%i==0)
            n/=i, v.push_back(i);
        }
        if(n!=1) v.push_back(n);
        cout<<v.size()<<"\n";
        for(ll x : v)
        print(x), putchar('\n');
    }
}
namespace Sub2 {
    mt19937_64 mt;

    lll abs(lll x) { return x>0 ? x : -x; }
    lll qpow(lll a, lll b, lll p)
    {
        lll ans=1;
        for(; b; b>>=1,(a*=a)%=p)
        if(b&1) (ans*=a)%=p;
        return ans;
    }
    bool millerRabin(lll n)
    {
        if(n==1) return 0;
        if(n%2==0) return n==2;

        lll u=n-1,t=0;
        while(u%2==0) u>>=1,++t;
        for(lll a : prime)
        {
            lll b=qpow(a, u, n);
            if(b==1||b==n-1||b==0) continue;
            for(int i=1; i<=t; i++)
            {
                b=b*b%n;
                if(b==n-1) {b=1; break;}
                else if(b==1) return 0;
            }
            if(b!=1) return 0;
        }
        return 1;
    }
    lll pollardRho(lll n)
    {
        lll s=0,t=0,c=mt()%(n-1)+1;
        for(int i=1;; i<<=1,s=t)
        {
            lll val=1;
            for(int j=1; j<=i; j++)
            {
                t=(t*t+c)%n;
                val=val*abs((lll)(t-s))%n;
                if(j%127==0)
                {
                    lll g=__gcd(val, (lll)n);
                    if(g!=1) return g;
                }
            }
            lll g=__gcd(val, (lll)n);
            if(g!=1) return g;
        }
        return 0;
    }
    vector<lll> calc(lll x)
    {
        vector<lll> v;
        if(x==1) return v;
        if(millerRabin(x))
        {
            v.push_back(x);
            return v;
        }
        lll p=x,t=0;
        while(p==x) p=pollardRho(x);
        while(x%p==0) x/=p,t++;
        v=calc(x);
        vector<lll> b=calc(p);
        for(lll e : b)
        for(int i=1; i<=t; i++)
        v.push_back(e);
        return v;
    }
    void print(lll x) { if(!x) return; print(x>>1); putchar('0'+(x&1)); }
    void work()
    {
        vector<lll> v=calc((unsigned long long)(n));
        sort(v.begin(), v.end());
        cout<<v.size()<<"\n";
        for(lll x : v)
        print(x), putchar('\n');
    }
}
int main()
{
    cin>>n>>phi;
    if(n.digit()<=32) Sub1::work();
    else if(n.digit()<=64) Sub2::work();
    return 0;
}