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

//package intro_basic;

import java.util.Scanner;

public class quasi_binary {
	public static void main(String[] args)
	{
		Scanner sc=new Scanner(System.in);
		int n;
		n=sc.nextInt();
		int dp[]=new int[1000001];
		for(int i=0;i<=1000000;++i)
		{
			dp[i]=0;
		}
		int num[]=new int[7];

		findnumber(dp,num,0);
		/*
		for(int i=6;i>=0;--i)
		{
			num[i]=0;
			int power=0;
			int val=0;
			for(int j=6;j>=0;--j)
			{
				val+=power*num[j];
				power*=10;
			}
			dp[val]=1;
			num[i]=1;
			power=0;
			val=0;
			for(int j=6;j>=0;--j)
			{
				val+=power*num[j];
				power*=10;
			}
			dp[val]=1;
		}
		*/
		int currval=n;
		int count=0;
		int br[]=new int[1000001];
		while(currval>0)
		{
			int k;
			for(k=currval;dp[k]!=1;--k)
			{
				
			}
			br[count]=k;
			currval=currval-k;
			count++;
		}
		System.out.println(count);
		for(int i=0;i<count;++i)
		{
			System.out.print(br[i]+" ");
		}
	}
	static void findnumber(int dp[],int num[],int index)
	{
		//base case
		if(index==7)
		{
			int power=1;
			int val=0;
			for(int j=6;j>=0;--j)
			{
				val+=power*num[j];
				power*=10;
			}
			if(val<=1000000)
			{
			dp[val]=1;
			}
			return;
		}
		
		//recursive case
		num[index]=0;
		findnumber(dp,num,index+1);
		num[index]=1;
		findnumber(dp,num,index+1);
		return;
	}
}
