贪心,每个答案的数尽量取1
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Lson (x<<1)
#define Rson ((x<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define MAXN (1000000+10)
long long mul(long long a,long long b){return (a*b)%F;}
long long add(long long a,long long b){return (a+b)%F;}
long long sub(long long a,long long b){return (a-b+(a-b)/F*F+F)%F;}
typedef long long ll;
int n;
int a[MAXN],siz=0;
int c[MAXN],d[MAXN];
int main()
{
// freopen("b.in","r",stdin);
// freopen(".out","w",stdout);
cin>>n;
d[1]=1;
Fork(i,2,8) d[i]=d[i-1]*10;
int siz=0;
while(n)
{
a[++siz]=n%10;
n/=10;
}
int k=0;
MEM(c)
For(i,siz)
{
k=max(k,a[i]);
For(j,a[i]) c[j]+=d[i];
}
cout<<k<<endl<<c[1];
Fork(i,2,k) cout<<' '<<c[i];cout<<endl;
return 0;
}