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

/**
 * Codeforces Beta Round #300
 * 
 * @author ProjectYoung
 */

import java.util.Scanner;

public class CF538B {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int[] num = new int[10];
    int len = 0;
    while (n > 0) {
      num[len++] = n % 10;
      n /= 10;
    }
    int max = 0;
    for (int i = 0; i < len; i++) {
      max = Math.max(max, num[i]);
    }
    System.out.println(max);
    int[] res = new int[10];
    int[] ten = new int[] {1, 10, 100, 1000, 10000, 100000, 1000000, 10000000};
    for (int i = 0; i < max; i++) {
      for (int j = 0; j < len; j++) {
        if (num[j] > 0) {
          res[i] += ten[j];
          num[j]--;
        }
      }
    }
    for (int i = 0; i < max; i++) {
      System.out.print(res[i] + " ");
    }
    sc.close();
  }
}
