#include<stdio.h>
#include<malloc.h>

typedef  struct Node
{
    char elem;
    struct Node *next;
}Node, *BinList;

BinList Init()
{
    BinList L = (BinList)malloc(sizeof(Node));
    L->next = NULL;
    return L;
}

BinList Create(BinList L)
{
    Node *p, *q;
    char num;
    p = L;
    while (scanf("%c", (char*)&num) == 1 && num != '\n')
    {
        q = (Node *)malloc(sizeof(Node));
        q->elem = num;
        q->next = NULL;
        p->next = q;
        p = p->next;
    }
    return L;

}

BinList Increase(BinList L)
{
    Node *p, *q = NULL;
    p = L->next;
    while (p != NULL)
    {
        if (p->elem == '0')
            q = p;
        p = p->next;
    }
    if (q == NULL)
    {
        q = (BinList)malloc(sizeof(Node));
        q->next = L->next;
        L->next = q;
    }
    q->elem = '1';
    p = q;
    p = p->next;
    while (p != NULL)
    {
        p->elem = '0';
        p = p->next;
    }

    return L;
}


void print(BinList L)
{

    Node *p;
    p = L->next;
    while (p)
    {
        putchar(p->elem);
        p = p->next;
    }
    putchar('\n');
}


int main()
{
    BinList L;
    L = Init();
    L = Create(L);
    L = Increase(L);
    print(L);


    return 0;
}