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


function main() {
    var n = readline();
    var all = [1,10,11];
    var prev = [10,11];
    for(var i=0;i<6;i++){
        var newPrev = [];
        for(var j=0;j<prev.length;j++){
            newPrev.push(Number(prev[j] + "0"))
            newPrev.push(Number(prev[j] + "1"))
        }
        prev = newPrev;
        for(var j=0;j<prev.length;j++){
            all.push(prev[j])
        }
    }
    all.sort((a,b) => b-a);
    var dp = [];
    dp[0] = 0;
    dp[1] = 1;
    var store = [];
    store[0] = [];
    store[1] = [1];
    for(var i=2;i<=n;i++){
        var min = dp[i-1] + 1;
        var cur = store[i-1].concat([1])
        for(var j =0;j<all.length;j++){
            if(dp[i-all[j]] && dp[i-all[j]] + 1 < min){
                min = dp[i-all[j]] + 1;
                var cur = store[i-all[j]].concat([all[j]])
            }
        }
        dp[i] = min;
        store[i] = cur;
    }
    print(dp[n])
    print(store[n].join(' '))
}




main()