#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <functional>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>

using namespace std;

#define REP(i, N) for(int (i)=0; (i)<(N); (i)++)
#define ll long long
#define mp make_pair
#define pb push_back

char line[1111111];

void solve(int len) {
	if(line[len-1] == '0') {
		line[len-1] = '1';
	} else if(line[len-2] == '1') {
		line[len-2] = line[len-1] = '0';
	} else {
		line[len-1] = '0';
		line[len-2] = '1';
		solve(len-2);
	}

}

int main() {
	while(scanf("%s", line+2) == 1) {
		line[0] = '0';
		line[1] = '0';
		int len = strlen(line);
		solve(len);
		char* start = line;

		while(*start == '0') start++;
		if(*start == '\0') printf("0\n");
		else printf("%s\n", start);
	}
	

	return 0;
}