#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

#define REP(i,s,e) for (i = s; i <= e; i++)
#define rep(i,n) REP (i,0,(int)(n)-1)
#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP (i,(int)(n)-1,0)
#define INF (int)1e8
#define MOD 1004535809

typedef long long ll;

ll num[1000];

ll power(ll x, int n) {
    ll ret = 1;
    while (n) {
        if (n % 2)
            ret *= x;
        x *= x;
        n /= 2;
    }
    return ret;
}

int main(void) {
    int i, n;
    string s;
    cin >> s;
    n = s.size();
    int digit = 0;
    int j = 0;
    rrep (i,n) {
        if (j == 18) {
            j = 0;
            digit++;
        }
        num[digit] += (s[i] - '0') * power(10,j);
        j++;
    }
    digit++;
    int ans = 0;
    while (true) {
        ans += num[0] % 2;
        ll carry = 0;
        bool end = true;
        rrep (i,digit)
            cout << num[i] << " ";
        cout << endl;
        rrep (i,digit) {
            num[i] += carry;
            if (num[i] % 2)
                carry = 1e18;
            else
                carry = 0;
            num[i] /= 2;
            if (num[i] != 0) end = false;
        }
        if (end)
            break;
    }
    cout << ans << endl;
    return 0;
}