#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>

using namespace std;

int main(){
	int hole[10] = {1,0,0,0,1,0,1,0,2,1};
	int n;
	cin >> n;
	int keta = (int)log10(n)+1;
	vector<int> times;
	int count = 0;

	for(int i=keta-1;i>=0;i--){
		int one = n/pow(10,i);
		n -= one*pow(10,i);
		cout << one << endl;
		count += hole[one];
		count ++;
		count ++;
	}

	cout << count+1 << endl;

  return 0;
}