#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>
 
using namespace std;
 
#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define F(i,j,k) fill(i[0],i[0]+j*j,k)
#define P(p) cout<<(p)<<endl;
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define INF 1<<25
#define pb push_back 
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int,int> pii;
typedef pair<long,long> pll;
typedef long long ll;
unsigned GetDigit(unsigned num){
    unsigned digit=0;
    while(num!=0){
		        num /= 10;
		        digit++;
		    }
    return digit;
}
int main(){
	ll N,a[11];
	cin>>N;
	int size=GetDigit(N),t=N;
	vector<ll> m;
	cout<<size<<endl;
	for(int i=size-1;i>=0;i--){
		
		a[i]=t%10;
		t/=10;
		if(a[i]==7)m.push_back(i);
	//	cout<<a[i]<<endl;
	}
	ll b=0;
	cout<<m.size()<<endl;
	for(int i=0;i<=m.size();i++){
		ll tmp=abs(size-m.back());
		cout<<tmp<<endl;
		m.pop_back();
		tmp--;
		b+=ll(pow(10,tmp));
	}
	N-=b;
	cout<<N<<" "<<b<<endl;
	return 0;
}