#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <vector>

using namespace std;

#define FOR(prom, a, b) for(int prom = (a); prom < (b); prom++)
#define FORD(prom, a, b) for(int prom = (a); prom > (b); prom--)
#define FORDE(prom, a, b) for(int prom = (a); prom >= (b); prom--)

#define DRI(a) int a; scanf("%d ", &a);
#define DRII(a, b) int a, b; scanf("%d %d ", &a, &b);

#define RI(a) scanf("%d ", &a);
#define RII(a, b) scanf("%d %d ", &a, &b);

#define PB push_back
#define MP make_pair

#define ll long long
#define ull unsigned long long

#define MM(co, cim) memset((co), (cim), sizeof((co)))

#define DEB(x) cerr << ">>> " << #x << " : " << x << endl;

int main ()
{
  string s;
  while(cin >> s) {
    bool done = false;
    bool pos = true;
    FORDE(i,s.size()-1,0) {
      if(s[i] == '0') {
        s[i] = '1';
        if(pos) {
          done = true;
          break;
        }
      } else {
        s[i] = '0';
        if(!pos) {
          done = true;
          break;
        }
      }
      pos = !pos;
    }
    if(!done) {
      if(pos) cout << 1;
      else cout << 11;
      cout << s << endl;
    }
    else {
      bool print = false;
      FOR(i,0,s.size()) {
        if(s[i] == '1') print = true;
        if(print) cout << s[i];
      }
      if(!print) cout << 0;
      cout << endl;
   }
  }
  return 0;
}