#include <bits/stdc++.h>
const int M = 1e9 + 7, N = 1e7 + 3;
using namespace std;
int main() {
  long long n, m, i, j = -1, k;
  bool ok = 0;
  string s;
  cin >> s;
  n = s.size();
  map<char, long long> b;
  i = -1;
  while (i < n - 1) {
    i++;
    if (s[i] == '2' and ok == 0) ok = 1, j = i;
    if (s[i] == '1') b[s[i]]++, s.erase(i, 1), i--, n--;
  }
  if (j == -1) {
    cout << s;
    for (i = 1; i <= b['1']; i++) cout << 1;
  } else {
    for (i = 0; i < n; i++) {
      if (j == i) {
        for (int j1 = 1; j1 <= b['1']; j1++) cout << 1;
      }
      cout << s[i];
    }
  }
}
