//#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountll((lint)(n))
#define highest(x) (63 - __builtin_clzll(x))
#define rep(i, n) for(int i = 0; i < int(n); i++)
#define rep2(i, l, r) for(int i = int(l); i < int(r); i++)
#define repr(i, n) for(int i = int(n) - 1; i >= 0; i--)
#define repr2(i, l, r) for(int i = int(r) - 1; i >= int(l); i--)
template<class itr> void array_output(itr start, itr goal){ for(auto i = start; i != goal; i++) cout << (i == start ? "" : " ") << (*i); cout << endl; }

string c;
int n;
int sub[1001001][20];

vector<bool> is_used;
vector<int> ans;

void dfs(int at){
    if(at == c.size()){
        array_output(all(ans));
        exit(0);
    }
    if(c[at] == '0') return;
    
    rep(i, 20){
        int num = sub[at][i];
        if(num == 0 || num > n || is_used[num]) continue;
        
        is_used[num] = true;
        ans.push_back(num);
        dfs(at + i + 1);
        is_used[num] = false;
        ans.pop_back();
    }
}

int main(){
    cin >> c;
    n = 0;
    int tmp = 0;
    while(tmp < c.size()){
        n++;
        tmp += highest(n) + 1;
    }
    
    rep(i, c.size()){
        int num = 0;
        rep(j, 20){
            if(i + j >= c.size()) continue;
            
            num = num * 2 + (c[i + j] - '0');
            sub[i][j] = num;
        }
    }
    
    is_used.assign(n + 1, false);
    dfs(0);
    abort();
}