#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int cg(long long int n) { return n ^ (n >> 1); }
long long int SUM(long long int a) { return (a * (a + 1) / 2); }
bool CAN(int x, int y, int n, int m) {
  if (x >= 0 && y >= 0 && x < n && y < m) {
    return true;
  }
  return false;
}
double her(double x1, double arayikhalatyan, double x2, double y2) {
  return sqrt((x1 - x2) * (x1 - x2) +
              (arayikhalatyan - y2) * (arayikhalatyan - y2));
}
string strsum(string a, string b) {
  int p = 0;
  string c;
  reverse(a.begin(), a.end());
  reverse(b.begin(), b.end());
  if (b.length() < a.length()) {
    for (int i = b.length(); i < a.length(); i++) {
      b += "0";
    }
  } else {
    for (int i = a.length(); i < b.length(); i++) {
      a += "0";
    }
  }
  a += "0", b += "0";
  for (int i = 0; i < a.length(); i++) {
    c += (a[i] - '0' + b[i] - '0' + p) % 10 + '0';
    p = (a[i] + b[i] - '0' - '0' + p) / 10;
  }
  if (c[c.length() - 1] == '0') c.erase(c.length() - 1, 1);
  reverse(c.begin(), c.end());
  return c;
}
string strmin(string a, string b) {
  if (a.length() > b.length()) return b;
  if (b.length() > a.length()) return a;
  for (int i = 0; i < a.length(); i++) {
    if (a[i] > b[i]) return b;
    if (b[i] > a[i]) return a;
  }
  return a;
}
char vow[] = {'a', 'e', 'i', 'o', 'u'};
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
const int N = 1e6 + 30;
const long long int mod = 1000000007;
string s, t;
int mx, zro, a[2010][2010];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> s;
  for (int i = s.length() - 1; i >= 0; i--) {
    mx = 0, zro = 0;
    for (int j = i; j < s.length(); j++) {
      if (s[j] == '0')
        zro++;
      else
        mx++;
      mx = max(zro, mx);
      a[i][j] = mx;
    }
  }
  for (int i = s.length() - 1; i >= 0; i--) {
    if (s[i] == '1') {
      mx = 0, zro = 0;
      s[i] = '0';
      for (int j = i; j < s.length(); j++) {
        if (s[j] == '0')
          zro++;
        else
          mx++;
        mx = max(zro, mx);
        if (a[i][j] != mx) {
          s[i] = '1';
          break;
        }
      }
    }
  }
  cout << s;
  return 0;
}
