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.OutputStreamWriter;
import java.io.PrintWriter;
import java.text.Collator;
import java.util.ArrayList;
import java.util.Collections;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
import java.util.Scanner;

public class QuasiBInary {

    private static int[] quasiBinaries;
    private static int globalCount;
    
    private static List<Integer> list = new ArrayList<>();
    
    private static void init(int n)  {
        Queue <Integer> q = new LinkedList<>();
        q.add(1);
        while(q.isEmpty() == false) {
            int num = q.poll();
            if (num > n) break;
            list.add(num);
            q.add(num * 10);
            q.add(num * 10 + 1);
        }
    }
    
    static class State {
        int num;
        int steps;
        int quasi;
        State myParent;
        
        public State(int num, int steps, int quasi, State myParent) {
            super();
            this.num = num;
            this.steps = steps;
            this.quasi = quasi;
            this.myParent = myParent;
        }       
    }
    
    private static void solve(int n) {
        Queue<State> q = new LinkedList<>();
        q.add(new State(n, 0, list.get(list.size() - 1), null));
        while (q.size() > 0) {
            State state = q.poll();
            if (state.num == 0) {
                System.out.println(state.steps);
                State par = state;
                int cnt = state.steps;
                while (cnt-- > 0) {
                    System.out.print(par.quasi + " ");
                    par = par.myParent;
                    
                }
                break;
            }
            for (int item : list) {
                if (state.num < item) break;
                State ss = new State(state.num - item, state.steps + 1, item, state);
                q.add(ss);
            }
        }       
    }
    
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        OutputStreamWriter os = new OutputStreamWriter(System.out);
        PrintWriter pw = new PrintWriter(os);
        quasiBinaries = new int[] { 1000000, 111111, 111110, 111101, 111011,
                110111, 101111, 11111, 11110, 11101, 11011, 10111, 1111, 1110,
                1101, 1011, 111, 110, 101, 100, 11, 10, 1 };
        
        int n = in.nextInt();
        init(n);
        Collections.sort(list);
        Collections.reverse(list);
        solve(n);
        //int start = 0;
        // largest quasyBinary smaller than n
        /*for (int i = 0; i < quasiBinaries.length; i++) {
            if (quasiBinaries[i] > n) {
                continue;
            } else {
                start = i;
            }
        }
        for (int i = start; i < quasiBinaries.length; i++) {
            

        }*/
        pw.close();
        in.close();

    }

    
}
