#include<iostream>

#include<vector>
#include<algorithm>
#include<stack>
#include<map>
#include<queue>
#include<list>
#include<string>

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stdlib.h>

using namespace std;

#define FOR(i,a,b) for(int i=a; i<=b; i++)
#define PB push_back
#define fi first
#define se second
#define make_pair
#define PII pair<int, int>

#define SIZE(s) (int)(s).size()

#define INF 987654321
#define ll long long

//----------

#define MAX 1000047

char S[MAX];
char temp[MAX];

void solve() {

	int n = strlen(S)-1;

	if ((int)strlen(S) == 2 && S[0] == '1' && S[1] == '1') {
		printf("0\n");
		return;
	}

	while (true) {
			if (S[n] == '0') {
				S[n] = '1';
				printf("%s\n", S);
				return;
			
			} else { // S[n] == 1
 				if (n == 0) {
					//printf("mam\n");
					printf("110");
					strcpy(temp, S+1);
					printf("%s\n", temp);
					return;

				} else {
					if (S[n-1] == '1') {

						if (n-1 == 0) {
							//printf("mam\n");
							
							strcpy(temp, S+2);
							printf("%s\n", temp);

							return;

						} else {
							S[n-1] = '0';
							S[n] = '0';
							printf("%s\n", S);
							return;
						}
					} else {
						S[n-1] = '1';
						S[n] = '0';
						n -= 2;
					}	
				}
			}
		}
}

int main(){
	while(scanf("%s", S) == 1){
		solve();		
	}
	return 0;
}