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.io.*;
import java.util.*;

public class Main{
    public static void main(String[] args) {
        FastReader fs=new FastReader();
        PrintWriter out=new PrintWriter(System.out);
        int t=1;
        //t=fs.nextInt();
        for(int i=1;i<=t;i++) {
        	Main m=new Main();
            m.solve(i,out,fs);
        }
        out.close();
    } 
   

    public void solve(int test,PrintWriter out,FastReader fs){
        char a[]=fs.nextCharArray();
        int steps=0;
        for(int i=0;i<a.length;i++)steps=Integer.max(steps, (a[i]-'0') );
        int ans[]=new int[steps];
        for(int i=0;i<a.length;i++){
            int itr=a[i]-'0';
            for(int j=0;j<steps;j++){
                ans[j]*=10;
                if(itr>0){
                    ans[j]+=1;
                    itr--;
                }
            }
        }
        out.println(steps);
        for(int i=0;i<steps;i++)
            out.print(ans[i]+" ");
    }
}
class SegmentTree{
	long t[];
	SegmentTree(int n){
		t=new long[4*n];
	}
	void update(int v,int tl,int tr,int pos,long delta) {
		if(tl==tr) {
			t[v]+=delta;
		}else {
			int tm=(tl+tr)/2;
			if(pos<=tm)
				update(2*v,tl,tm,pos,delta);
			else
				update(2*v+1,tm+1,tr,pos,delta);
			t[v]=t[2*v]+t[2*v+1];
		}
	}
	long sum(int v,int l,int r,int tl,int tr) {
		if(l>r)return 0;
		if(l==tl&&r==tr) {
			return t[v];
		}else {
			int tm=(tl+tr)/2;
			return sum(2*v,l,Integer.min(r,tm),tl,tm)+sum(2*v+1,Integer.max(l, tm+1),r,tm+1,tr);
		}
	}
}
class FastReader{
    BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st=new StringTokenizer("");  
    String next(){
        while(!st.hasMoreTokens()){
            try {
                st=new StringTokenizer(br.readLine()); 
            } catch (IOException e) {
				e.printStackTrace();
			}
        }
        return st.nextToken();
    }
    int nextInt(){
        return Integer.parseInt(next());
    }
    long nextLong(){
        return Long.parseLong(next());
    }
    int[] nextIntArray(int n){
        int a[]=new int[n];
        for(int i=0;i<n;i++)a[i]=nextInt();
        return a;
    } 
    long[] nextLongArray(int n){
        long a[]=new long[n];
        for(int i=0;i<n;i++)a[i]=nextInt();
        return a;
    }
    char[] nextCharArray(){
        char a[]=next().toCharArray();
        return a;
    }
}