← Home
// Road to IOI 2026
 
#include <bits/stdc++.h>
using namespace std;
 
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
 
using ll = long long;
 
#define int long long
#define line '\n'
 
#ifdef Shakuu
    #include "debug.h"
#else 
    #define debug(...) 42
#endif
 
const int MOAI = 1e9 + 7, Daniyar = 998244353, inf = 1e18;
const int N = 1e6, lg = 31;
 
// © khba
void solve() {
    string s; cin >> s;
    int n = s.size();
    stack<int>st;
    for (int i = 0; i < n; ++i) {
        if (s[i] == '0') {
            if (st.size() and s[st.top()] == '1') st.pop();
            else st.push(i);
        } else st.push(i);
    }
    while (st.size()) s[st.top()] = '0', st.pop();
    cout << s;
}
 
signed main()
{
    // #define test_cases
    
    cin.tie(0)->sync_with_stdio(0);
 
    int t = 1;
#ifdef test_cases
    cin >> t;
#endif
 
    while (t--)
    {
        solve();
        cout << '\n';
    }
}