#include <bits/stdc++.h>
using ll = long long;
using namespace std;
void debugi(vector<int>& vec) {
  int n = (int)vec.size();
  for (int i = 0; i < n; i++) {
    cout << vec[i] << " ";
  }
  cout << endl;
}
void debugl(vector<ll>& vec) {
  int n = (int)vec.size();
  for (int i = 0; i < n; i++) {
    cout << vec[i] << " ";
  }
  cout << endl;
}
void debugmap(map<int, int>& mp) {
  for (auto x : mp) {
    cout << x.first << " " << x.second << " , ";
  }
  cout << endl;
}
void debugset(set<int>& st) {
  for (auto x : st) {
    cout << x << " ";
  }
  cout << endl;
}
void debugparri(vector<pair<int, int>>& arr) {
  for (int i = 0; i < (int)arr.size(); i++) {
    cout << "[" << arr[i].first << " : " << arr[i].second << "]"
         << " ";
  }
  cout << endl;
}
void debugpi(pair<int, int>& pi) {
  cout << pi.first << " " << pi.second << endl;
}
void debugq(queue<int> q) {
  while (!q.empty()) {
    cout << q.front() << " ";
    q.pop();
  }
  cout << endl;
}
bool check(int n, int i, int j) {
  if ((0 <= i & i < n) && (0 <= j & j < n)) {
    return true;
  }
  return false;
}
ll powab(ll a, ll b, ll mod) {
  if (b == 0) {
    return 1;
  }
  ll z = powab(a, b / 2, mod);
  ll res = (z * z * 1LL) % mod;
  if (b & 1) {
    res = (res * 1LL * a) % mod;
  }
  return res;
}
void upd(int k, int x, vector<int>& tree, int n) {
  if (k == 0) {
    return;
  }
  while (k <= n) {
    tree[k] += x;
    k += (k & -k);
  }
}
int sum(int k, vector<int>& tree, int n) {
  int s = 0;
  while (k >= 1) {
    s += tree[k];
    k -= (k & -k);
  }
  return s;
}
ll gcd(ll a, ll b) {
  if (b == 0) {
    return a;
  }
  return gcd(b, a % b);
}
int ans = 0, n, m;
int main(int argc, const char* argv[]) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  string s;
  cin >> s;
  int n = s.size();
  vector<int> arr(n);
  for (int i = 0; i < n; i++) {
    arr[i] = s[i] - '0';
  }
  vector<char> t(n);
  int end0 = 0, end1 = 0, len0 = 0, len1 = 0;
  for (int i = n - 1; i >= 0; i--) {
    if (s[i] == '0') {
      int x = max(len0, len1);
      len0 = x + 1;
      t[i] = '0';
      int y = max(end0, end1);
      end0 = y + 1;
    } else {
      int x = max(len0, len1);
      int y = end1 + 1;
      int z = max(y, end0);
      if (x + 1 == y) {
        t[i] = '0';
        len0 = x + 1;
      } else {
        t[i] = '1';
        len1 += 1;
      }
      end1 += 1;
    }
  }
  for (int i = 0; i < n; i++) {
    cout << t[i];
  }
  cout << endl;
}
