#include <bits/stdc++.h>
using namespace std;
const int N = 1e6;
const long long mod = 1e9 + 7;
const long long mod2 = 998244353;
const int oo = 0x7fffffff;
const int sup = 0x80000000;
template <typename it>
void db(it *begin, it *end) {
  while (begin != end) cout << (*begin++) << " ";
  puts("");
}
template <typename it>
string to_str(it n) {
  string s = "";
  while (n) s += n % 10 + '0', n /= 10;
  reverse(s.begin(), s.end());
  return s;
}
template <typename it>
int o(it a) {
  cout << a << endl;
  return 0;
}
long long mul(long long a, long long b, long long c) {
  long long ans = 0;
  for (; b; b >>= 1, a = (a + a) % c)
    if (b & 1) ans = (ans + a) % c;
  return ans;
}
long long ksm(long long a, long long b, long long c) {
  long long ans = 1;
  for (; b; b >>= 1, a = mul(a, a, c))
    if (b & 1) ans = mul(ans, a, c);
  return ans;
}
void exgcd(long long a, long long b, long long &x, long long &y) {
  if (!b)
    x = 1, y = 0;
  else
    exgcd(b, a % b, y, x), y -= (a / b) * x;
}
char s[N], t[N];
int main() {
  cin >> s;
  int a = 0, b = 0;
  int n = strlen(s);
  for (int i = n - 1; i >= 0; i--) {
    if (s[i] == '0') {
      a++, t[i] = '0';
    } else if (s[i] == '1') {
      if (b >= a)
        t[i] = '0';
      else
        t[i] = '1', b++;
    }
  }
  t[n] = '\0';
  return o(t);
}
