#include <bits/stdc++.h>
using namespace std;
long long int large = (long long int)1e13 + 7;
long long int mod = (long long int)1e9 + 7;
long long int const N = 300000;
long long int mod_exp(long long int x, long long int n) {
  long long int result = 1;
  while (n > 0) {
    if (n % 2 == 1) result = (result * x) % mod;
    x = (x * x) % mod;
    n = n / 2;
  }
  return result % mod;
}
long long int mod_inverse(long long int a) { return mod_exp(a, mod - 2); }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int T, i, j, ij;
  T = 1;
  while (T--) {
    string s;
    cin >> s;
    long long int n = s.size();
    string mix = "";
    string one = "";
    for (i = 0; i < n; i++) {
      if (s[i] == '1')
        one += '1';
      else
        mix += s[i];
    }
    string ans = "";
    for (i = 0; i < mix.size(); i++) {
      if (mix[i] == '2') break;
    }
    ans = ans + mix.substr(0, i);
    ans = ans + one;
    if (i != n) {
      ans = ans + mix.substr(i);
    }
    cout << ans;
  }
  return 0;
}
