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.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.StringTokenizer;
 import java.util.*;
 
 
public class quasi {
 
 static int quasi(int n){
   
   String s="";
   while(n>0){
    int x=n%10;
   // System.out.println(x);
    if(x>0){
      s="1"+s;
    }else{

      s="0"+s;
    }
     n=n/10;



   }
//   System.out.println("s:"+s);
   return Integer.parseInt(s);

 }
 static ArrayList<Integer> arr=new ArrayList<Integer>();
 public static int solve(int n){
  if(n==0){
    return 0;
  }
  int m=quasi(n);
  arr.add(m);
  return solve(n-m);


 }

 
  public static void main(String[] args) {
    // TODO Auto-generated method stub
    Scanner sc=new Scanner(System.in);
    InputStream inputStream = System.in;
    OutputStream outputStream = System.out;
    //InputReader sc = new InputReader(inputStream);
        //PrintWriter out = new PrintWriter(outputStream);
    int n=sc.nextInt();
    solve(n);
    System.out.println(arr.size());
    for(int i=0;i<arr.size();i++){
      System.out.print(arr.get(i)+" ");
    }
  //   int m=quasi(n);
  // //  int res=quasi(2);
  //   // System.out.println("res: "+res);
  //   ArrayList<Integer> arr=new ArrayList<Integer>();
  //   arr.add(m);
    
  //   int cnt=0;
  //   while(n!=0){
  //     n=n-m;
  //     if(n==0){
  //       break;
  //     }
  //     m=quasi(n);
  //        // System.out.println("n:"+n+" m: "+m);

  //     arr.add(m);
  //     cnt++;
  //   }
  //   System.out.println(cnt+1);
  //   for(int i=0;i<arr.size();i++){
  //     System.out.print(arr.get(i)+" ");
  //   }


    
   
  }
  

 
  
  static class InputReader {
      public BufferedReader reader;
      public StringTokenizer tokenizer;
 
      public InputReader(InputStream stream) {
          reader = new BufferedReader(new InputStreamReader(stream), 32768);
          tokenizer = null;
      }
 
      public String next() {
          while (tokenizer == null || !tokenizer.hasMoreTokens()) {
              try {
                  tokenizer = new StringTokenizer(reader.readLine());
              } catch (IOException e) {
                  throw new RuntimeException(e);
              }
          }
          return tokenizer.nextToken();
      }
 
      public int nextInt() {
          return Integer.parseInt(next());
      }
      
      public long nextLong()
      {
        return Long.parseLong(next());
      }
 
  }
 
 
}