111111
 100009
 10011
 1000000
 8
 10201
 102030
 908172
 123456
 415
 900000
 21
 909090
 314159
 999999
 909823
 987654
 1453
 1435
 98
 10
 2
 1

1
111111
 9
100001 1 1 1 1 1 1 1 1
 1
10011
 1
1000000
 8
1 1 1 1 1 1 1 1
 2
10101 100
 3
101010 1010 10
 9
101111 101011 101010 101010 101010 101010 101010 101000 100000
 6
111111 11111 1111 111 11 1
 5
111 101 101 101 1
 9
100000 100000 100000 100000 100000 100000 100000 100000 100000
 2
11 10
 9
101010 101010 101010 101010 101010 101010 101010 101010 101010
 9
111111 101011 101011 1011 11 1 1 1 1
 9
111111 111111 111111 111111 111111 111111 111111 111111 111111
 9
101111 101111 101101 101100 101100 101100 101100 101100 101000
 9
111111 111111 111111 111111 111110 111100 111000 110000 100000
 5
1111 111 111 110 10
 5
1111 111 111 101 1
 9
11 11 11 11 11 11 11 11 10
 1
10
 2
1 1
 1
1


import java.util.Scanner;
import java.util.Vector;

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author workzone
 */
public class quasi_binary {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int n;
        n=sc.nextInt();
        int dp[]=new int[1000001];
        for(int i=0;i<=1000000;++i)
        {
            dp[i]=0;
        }
        int new1[]=new int[7];
        findquasi(dp,new1,0);
        Vector v=new Vector();
        for(int i=0;i<=1000000;++i)
        {
            if(dp[i]==1)
            {
                v.addElement(new Integer(i));
           
            }
        }
        for(int i=v.size()-1;i>0;--i)
        {
            int num=(int)v.elementAt(i);
            for(int j=num;j<=1000000;++j)
            {
                if(dp[j-num]!=0 && dp[j]!=0)
                {
                    dp[j]=Math.min(dp[j],dp[j-num]+1);
                }
                else if(dp[j-num]==0 && dp[j]==0)
                {
                    continue;
                }
                else
                {
                    dp[j]=Math.max(dp[j],dp[j-num]+1);
                }
            }
        }
        
        System.out.println(dp[n]);
        
        for(int i=0;i<=50;++i)
        {
            System.out.print(dp[i]+" ");
        }
        
        System.out.println();
        for(int i=n;i>0;)
        {
            //System.out.println(i);
            if(dp[i]==1)
            {
                System.out.print(i+" ");
                break;
            }
            int k;
            for(k=1;(int)v.elementAt(k)<i;++k)
            {
                if(dp[i-(int)v.elementAt(k)]==dp[i]-1)
                {
                    System.out.print((int)v.elementAt(k)+" ");
                    //System.out.println(i);
                    i=i-(int)v.elementAt(k);
                    //System.out.println(i);
                    break;
                }
            }
        }
        
    }
    static void findquasi(int dp[],int new1[],int index)
    {
        ///base case
        if(index==7)
        {
            int power=1;
            int val=0;
            for(int i=6;i>=0;--i)
            {
                val+=new1[i]*power;
                power*=10;
            }
            if(val<=1000000)
            dp[val]=1;
            return;
        }
        
        //recursive case
        new1[index]=0;
        findquasi(dp,new1,index+1);
        new1[index]=1;
        findquasi(dp,new1,index+1);
        return;
    }
}
